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.

A347626 Number of partitions of n^n into distinct odd parts.

Original entry on oeis.org

1, 1, 1, 14, 2824974, 7375247711025022789604527681
Offset: 0

Views

Author

Seiichi Manyama, Sep 09 2021

Keywords

Comments

The next term a(6) = 1.46058224...*10^116 is too large to include.

Crossrefs

Main diagonal of A347630.

Programs

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

Formula

a(n) = [x^(n^n)] Product_{k>=0} (1 + x^(2*k+1)).
a(n) = A000700(n^n).