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

A066102
Number of distinct prime factors of sigma_4(n), the sum of the 4th powers of divisors of n.
2
0, 1, 2, 3, 2, 3, 2, 2, 3, 3, 2, 5, 2, 3, 3, 4, 2, 4, 3, 5, 3, 3, 2, 4, 4, 3, 4, 5, 2, 4, 3, 5, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 4, 5, 5, 3, 3, 5, 5, 5, 3, 5, 3, 4, 3, 4, 4, 3, 4, 6, 2, 4, 5, 4, 3, 4, 3, 5, 3, 4, 2, 5, 2, 4, 6, 6, 3, 4, 4, 6, 4, 4, 4, 6, 3, 4, 3, 4, 3, 6, 3, 5, 4, 4, 4, 7, 3, 6, 5, 5, 3, 4, 2, 4, 4
OFFSET
1,3
LINKS
FORMULA
a(n) = omega(sigma_4(n)) = A001221(A001159(n)).
MATHEMATICA
Table[PrimeNu[DivisorSigma[4, n]], {n, 1, 50}] (* G. C. Greubel, May 08 2017 *)
PROG
(PARI) a(n) = { omega(sigma(n, 4)) } \\ Harry J. Smith, Nov 14 2009
CROSSREFS
Sequence in context: A276862 A371442 A175066 * A036048 A145384 A339601
KEYWORD
nonn
AUTHOR
Labos Elemer, Dec 04 2001
STATUS
approved