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

A349542
Number of partitions of n into distinct unitary divisors of n.
1
1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2
OFFSET
0,7
LINKS
FORMULA
a(n) = [x^n] Product_{d|n, gcd(d,n/d) = 1} (1 + x^d).
MATHEMATICA
a[n_] := SeriesCoefficient[Product[(1 + Boole[GCD[n/d, d] == 1] x^d), {d, Divisors[n]}], {x, 0, n}]; Table[a[n], {n, 0, 114}]
PROG
(PARI) A349542(n) = if(!n, 1, my(p=1); fordiv(n, d, if(1==gcd(d, n/d), p *= (1 + 'x^d))); polcoeff(p, n)); \\ Antti Karttunen, Nov 22 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Nov 21 2021
STATUS
approved