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.
%I A347615 #31 Sep 14 2021 04:12:26 %S A347615 1,1,1,1,1,1,1,1,2,1,1,1,5,3,1,1,1,22,30,5,1,1,1,231,3010,231,7,1,1,1, %T A347615 8349,18004327,1741630,1958,11,1,1,1,1741630,133978259344888, %U A347615 365749566870782,3163127352,17977,15,1,1,1,4351078600,233202632378520643600875145,61847822068260244309086870983975,1606903190858354689128371,15285151248481,173525,22,1 %N A347615 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k. %F A347615 T(n,k) = A000041(n^k). %e A347615 Square array begins: %e A347615 1, 1, 1, 1, 1, ... %e A347615 1, 1, 1, 1, 1, ... %e A347615 1, 2, 5, 22, 231, ... %e A347615 1, 3, 30, 3010, 18004327, ... %e A347615 1, 5, 231, 1741630, 365749566870782, ... %o A347615 (PARI) T(n, k) = numbpart(n^k); %Y A347615 Columns k=0..3 give A000012, A000041, A072213, A128854. %Y A347615 Rows n=0+1, 2-10 give A000012, A068413, A248728, A068413(2*n), A248730, A248732, A248734, A068413(3*n), A248728(2*n), A070177. %Y A347615 Main diagonal gives A347607. %Y A347615 Cf. A238016, A347617, A347618, A347621. %K A347615 nonn,tabl %O A347615 0,9 %A A347615 _Seiichi Manyama_, Sep 08 2021