A378439 Möbius transform of A033630, where A033630 is the number of partitions of n into distinct divisors of n.

1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 3, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 29, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 21, 0, 0, 0, 1, 0, 19, 0, 0, 0, 0, 0, 11, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 12

Offset

1,24

Links

Antti Karttunen, Table of n, a(n) for n = 1..20000

Formula

a(n) = Sum_{d|n} A008683(n/d)*A033630(d).

Prog

(PARI)
A033630(n) = if(!n, 1, my(p=1); fordiv(n, d, p *= (1 + 'x^d)); polcoeff(p, n));
A378439(n) = sumdiv(n, d, moebius(n/d)*A033630(d));

Crossrefs

Cf. A008683, A033630, A378440 (Dirichlet inverse).

Sequence in context: A096693 A193139 A378440 * A083206 A069531 A335487

Adjacent sequences: A378436 A378437 A378438 * A378440 A378441 A378442

Keyword

nonn

Author

Antti Karttunen, Nov 27 2024

Status

approved