cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Nov 27 2024

Keywords

Crossrefs

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

Programs

  • 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));

Formula

a(n) = Sum_{d|n} A008683(n/d)*A033630(d).
Showing 1-1 of 1 results.