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.

A347654 Number of partitions of 10^n into distinct odd parts.

Original entry on oeis.org

1, 2, 2574, 517035762467311, 11296895312655297284351876487257601933458562000884410
Offset: 0

Views

Author

Seiichi Manyama, Sep 10 2021

Keywords

Comments

The next term a(5) = 5.5425352720...*10^171 is too large to include.

Crossrefs

Programs

  • PARI
    a(n) = polcoef(prod(k=0, 10^n\2, 1+x^(2*k+1)+x*O(x^(10^n))), 10^n);

Formula

a(n) = A000700(10^n).