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
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);
Square array begins: 0, 1, 1, 1, 1, 1, ... 1, 1, 1, 1, 1, 1, ... 0, 1, 2, 4, 8, 16, ... 0, 1, 7, 61, 547, 4921, ... 0, 1, 34, 1906, 117874, 7478386, ... 0, 1, 192, 91606, 53830967, 33219689231, ...
T(n, k) = if(k==0, n==1, polcoef(prod(j=1, n, 1/(1-x^j+x*O(x^(n^k-n)))), n^k-n));
Square array begins: 1, 1, 1, 1, 1, ... 1, 1, 1, 1, 1, ... 0, 1, 4, 21, 230, ... 0, 1, 25, 2996, 18004286, ... 0, 1, 201, 1741256, 365749566865192, ...
Comments