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

A300979
Number of partitions of n into parts having the same number of distinct prime divisors as n.
7
1, 1, 1, 1, 2, 2, 1, 4, 6, 7, 1, 12, 2, 19, 1, 1, 37, 44, 3, 66, 3, 2, 3, 138, 6, 196, 5, 275, 6, 380, 1, 520, 607, 6, 12, 5, 18, 1268, 17, 11, 22, 2214, 1, 2898, 30, 21, 38, 4872, 51, 6267, 54, 35, 63, 10219, 84, 43, 91, 61, 107, 20587, 2, 25793, 150, 105, 35924, 112, 1, 49646, 247, 180, 1
OFFSET
0,5
FORMULA
a(n) = [x^n] Product_{omega(k) = omega(n)} 1/(1 - x^k).
EXAMPLE
a(18) = 3 because we have [18], [12, 6] and [6, 6, 6], where 18, 12 and 6 are numbers that are divisible by exactly 2 different primes.
MAPLE
with(numtheory):
a:= proc(m) option remember; local k, b; k, b:= nops(factorset(m)),
proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
b(n, i-1)+`if`(nops(factorset(i))=k, b(n-i, min(i, n-i)), 0)))
end: b(m$2)
end:
seq(a(n), n=0..80); # Alois P. Heinz, Mar 17 2018
MATHEMATICA
Table[SeriesCoefficient[Product[1/(1 - Boole[PrimeNu[k] == PrimeNu[n]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 70}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 17 2018
STATUS
approved