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

A355030
a(n) is the number of possible values of the number of prime divisors (counted with multiplicity) of numbers with n divisors.
5
1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 2, 5, 1, 4, 1, 4, 2, 2, 1, 7, 2, 2, 3, 4, 1, 5, 1, 7, 2, 2, 2, 8, 1, 2, 2, 6, 1, 5, 1, 4, 4, 2, 1, 11, 2, 4, 2, 4, 1, 7, 2, 7, 2, 2, 1, 11, 1, 2, 4, 11, 2, 5, 1, 4, 2, 5, 1, 14, 1, 2, 4, 4, 2, 5, 1, 11, 5, 2, 1, 11, 2
OFFSET
1,4
COMMENTS
First differs from A305254 at n = 40, from A001055 and A252665 at n = 36, from A218320 at n = 32 and from A317791, A318559 and A326334 at n = 30.
LINKS
FORMULA
a(n) <= A001055(n).
a(p) = 1 for p prime.
a(A355031(n)) = n.
EXAMPLE
a(2) = 1 since numbers with 2 divisors are primes, i.e., numbers k with the single value Omega(k) = 1.
a(4) = 2 since numbers with 4 divisors are either of the following 2 forms: p1 * p2 with p1 and p2 being distinct primes, or of the form p^3 with p prime.
a(8) = 3 since numbers with 8 divisors are either of the following 3 forms: p1 * p2 * p3 with p1, p2 and p3 being distinct primes, p1 * p2^3, or p1^7.
MATHEMATICA
Table[Length[Union[Total[#-1]& /@ f[n]]], {n, 1, 100}] (* using the function f by T. D. Noe at A162247 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jun 16 2022
STATUS
approved