A066103 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A066103

Smallest m such that A001221(A001159(m)) = n.

2, 3, 4, 16, 12, 60, 96, 294, 720, 1936, 3920, 9680, 33712, 83248, 303408, 1517040, 5207472, 26972352, 74469808, 255166128

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

a(18) > 18000000. - Vaclav Kotesovec, Sep 06 2019

LINKS

Table of n, a(n) for n=1..20.

FORMULA

a(n) = Min(x : A001221(A001159(x)) = n) = Min(x; A066102(x) = n).

MATHEMATICA

Do[m = 1; While[PrimeNu[DivisorSigma[4, m]] != n, m++]; Print[m], {n, 1, 16}] (* Vaclav Kotesovec, Sep 05 2019 *)

PROG

(PARI) { for (n=1, 100, m=1; while (omega(sigma(m, 4)) != n, m++); write("b066103.txt", n, " ", m) ) } \\ Harry J. Smith, Nov 14 2009

CROSSREFS

Cf. A001159, A001221, A066102.

Sequence in context: A375280 A113232 A095261 * A237341 A004833 A350746

Adjacent sequences: A066100 A066101 A066102 * A066104 A066105 A066106

KEYWORD

nonn,more

AUTHOR

Labos Elemer, Dec 04 2001

EXTENSIONS

a(13) from Harry J. Smith, Nov 14 2009

a(14)-a(17) from Vaclav Kotesovec, Sep 06 2019

a(18)-a(20) from Amiram Eldar, Jul 04 2024

STATUS

approved