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.

A070235 Number of partitions of 3^n into distinct terms.

Original entry on oeis.org

1, 2, 8, 192, 84756, 5807301632, 2496696209705056142, 4077067982967062771640042697374910, 1661834856564765736512658856496529945178404778001420955780288
Offset: 0

Views

Author

Robert G. Wilson v, May 08 2002

Keywords

Crossrefs

Programs

  • Mathematica
    Table[ PartitionsQ[3^n], {n, 0, 10}]

Formula

a(n) ~ exp(Pi*sqrt(3^(n-1)))/(4*3^(3*n/4+1/4)). - Ilya Gutkovskiy, Jan 13 2017

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