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.
a:= n-> combinat[numbpart](n^n): seq(a(n), n=0..6); # Alois P. Heinz, Sep 09 2021
a(n) = numbpart(n^n);
from sympy.functions import partition def A347607(n): return partition(n**n) # Chai Wah Wu, Sep 09 2021
Table[ PartitionsQ[10^n], {n, 0, 4}]
a(n) = polcoef(prod(k=1, 10^n, 1+x^k+x*O(x^(10^n))), 10^n); \\ Seiichi Manyama, Sep 10 2021
Square array begins: 1, 1, 1, 1, 1, ... 1, 1, 1, 1, 1, ... 1, 1, 2, 6, 32, ... 1, 2, 8, 192, 84756, ... 1, 2, 32, 16444, 11784471548, ...
Table[If[n == k == 0, 1, PartitionsQ[#^k] &[n - k]], {n, 0, 9}, {k, n, 0, -1}] // Flatten (* Michael De Vlieger, Sep 09 2021 *)
T(n, k) = polcoef(prod(j=1, n^k, 1+x^j+x*O(x^(n^k))), n^k);
a(n) = polcoef(prod(k=0, n^n\2, 1+x^(2*k+1)+x*O(x^(n^n))), n^n);
Table[IntegerPart[PartitionsQ[n^n]^(1/n)],{n,1,7}]
Comments