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-2 of 2 results.

A064701 Duplicate of A035142.

Original entry on oeis.org

0, 1, 2, 6, 20, 29, 46
Offset: 1

Views

Author

Keywords

A258596 Number of divisors of the number of partitions of n into distinct parts, a(n) = A000005(A000009(n)).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 2, 4, 4, 4, 6, 4, 6, 4, 4, 6, 4, 4, 8, 7, 6, 2, 8, 4, 4, 8, 14, 8, 9, 8, 12, 16, 14, 10, 12, 6, 16, 24, 4, 8, 36, 8, 16, 8, 12, 27, 16, 16, 28, 8, 4, 8, 22, 8, 8, 6, 16, 16, 42, 32, 6, 8, 20, 6, 48, 12, 16, 28, 8, 2, 12, 20, 16, 12, 4, 32
Offset: 0

Views

Author

Giovanni Resta, Jun 04 2015

Keywords

Comments

a(n) is odd for n = 0, 1, 2, 6, 20, 29, 46, ... ; see A035142. - Michel Marcus, Jun 19 2015

Links

Crossrefs

Cf. A000009, A085543.

Programs

  • Mathematica
    DivisorSigma[0, PartitionsQ@ Range[0, 100]]
  • PARI
    a(n) = numdiv(polcoeff(prod(k=1, n, 1 + x^k, 1 + x * O(x^n)), n)); \\ Michel Marcus, Jun 19 2015

Formula

a(n) = A000005(A000009(n)).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.