login

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”).

A112758
Number of distinct prime factors of n-th 5-smooth number.
4
0, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 1, 3, 1, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 2, 2, 3, 1, 1, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 3, 1, 2, 1, 3, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 3, 1, 3, 2, 2, 3, 2, 3, 3, 2, 2, 1, 3, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 3, 2
OFFSET
1,6
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..750 from G. C. Greubel)
FORMULA
a(n) = A001221(A051037(n)).
a(n) = 3 - 0^A112760(n) - 0^A112761(n) - 0^A112762(n).
a(n) <= 3.
MATHEMATICA
aa = {}; Do[If[8 n - EulerPhi[30 n] == 0, AppendTo[aa, n]], {n, 1, 100}]; PrimeNu[aa] (* G. C. Greubel, May 07 2017 *)
PrimeNu[#]&/@Select[Range[2000], Max[FactorInteger[#][[All, 1]]]<6&] (* Harvey P. Dale, Apr 12 2020 *)
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Sep 18 2005
STATUS
approved