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

A323305
Number of divisors of the number of prime factors of n counted with multiplicity.
5
1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 2, 3, 2, 2, 1, 3, 1, 2, 2, 4, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 3, 2, 1, 3, 2, 2, 2
OFFSET
1,4
COMMENTS
a(1) = 1 by convention.
First differs from A036430 at a(64) = 4, A036430(64) = 3.
FORMULA
a(n) = A000005(A001222(n)).
MATHEMATICA
Array[Length@*Divisors@*PrimeOmega, 100]
PROG
(PARI) a(n) = if (n==1, 1, numdiv(bigomega(n))); \\ Michel Marcus, Jan 13 2019
CROSSREFS
Positions of 1's are 1 and the prime numbers A008578.
Positions of 2's are A063989.
Sequence in context: A024935 A082477 A036430 * A322794 A163377 A290085
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 13 2019
STATUS
approved