The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066103 Smallest m such that A001221(A001159(m)) = n. 0
 2, 3, 4, 16, 12, 60, 96, 294, 720, 1936, 3920, 9680, 33712, 83248, 303408, 1517040, 5207472 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(18) > 18000000. - Vaclav Kotesovec, Sep 06 2019 LINKS 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: A076965 A113232 A095261 * A237341 A004833 A283515 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 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 01:27 EDT 2021. Contains 347698 sequences. (Running on oeis4.)