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.

A347607 Number of partitions of n^n.

Original entry on oeis.org

1, 1, 5, 3010, 365749566870782, 8630901377559029573671524821295260243701883575513498104067
Offset: 0

Views

Author

Seiichi Manyama, Sep 08 2021

Keywords

Comments

The next term a(6) = 1.30449952...*10^235 is too large to include.
a(7) = 1.5782589391...*10^1004. - Chai Wah Wu, Sep 09 2021

Crossrefs

Main diagonal of A347615.

Programs

  • Maple
    a:= n-> combinat[numbpart](n^n):
    seq(a(n), n=0..6);  # Alois P. Heinz, Sep 09 2021
  • PARI
    a(n) = numbpart(n^n);
    
  • Python
    from sympy.functions import partition
    def A347607(n): return partition(n**n) # Chai Wah Wu, Sep 09 2021

Formula

a(n) = A000041(n^n).