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 A326474 #14 Mar 24 2020 03:41:52 %S A326474 1,0,1,0,1,1,0,1,2,1,0,1,22,3,1,0,1,170,63,4,1,0,1,1366,2187,124,5,1, %T A326474 0,1,10922,59535,7732,205,6,1,0,1,87382,1594323,599548,18485,306,7,1, %U A326474 0,1,699050,43033599,39945364,2416045,36126,427,8,1 %N A326474 A(n, k) = (m*k)! [x^k] MittagLefflerE(m, x)^n, for m = 3, n >= 0, k >= 0; square array read by descending antidiagonals. %e A326474 Array starts: %e A326474 [0] 1, 0, 0, 0, 0, 0, 0, ... A000007 %e A326474 [1] 1, 1, 1, 1, 1, 1, 1, ... A000012 %e A326474 [2] 1, 2, 22, 170, 1366, 10922, 87382, ... A007613 %e A326474 [3] 1, 3, 63, 2187, 59535, 1594323, 43033599, ... %e A326474 [4] 1, 4, 124, 7732, 599548, 39945364, 2556712828, ... %e A326474 [5] 1, 5, 205, 18485, 2416045, 352060805, 46660373965, ... %e A326474 [6] 1, 6, 306, 36126, 6673266, 1544907006, 379696000626, ... %e A326474 A051874, %t A326474 (* The function MLPower is defined in A326327. *) %t A326474 For[n = 0, n < 8, n++, Print[MLPower[3, n, 8]]] %o A326474 (Sage) # uses[MLPower from A326327] %o A326474 for n in (0..6): print(MLPower(3, n, 9)) %Y A326474 Rows include: A000007, A000012, A007613. %Y A326474 Columns include: A051874. %Y A326474 Cf. A326476 (m=2, p>=0), A326327 (m=2, p<=0), this sequence (m=3, p>=0), A326475 (m=3, p<=0). %K A326474 nonn,tabl %O A326474 0,9 %A A326474 _Peter Luschny_, Jul 08 2019