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 A326475 #13 Mar 24 2020 03:42:16 %S A326475 1,0,1,0,-1,1,0,19,-2,1,0,-1513,58,-3,1,0,315523,-6218,117,-4,1,0, %T A326475 -136085041,1630330,-15795,196,-5,1,0,105261234643,-847053482,4997781, %U A326475 -31924,295,-6,1,0,-132705221399353,766492673914,-3042574083,11840836,-56285,414,-7,1 %N A326475 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 A326475 Array starts: %e A326475 [0] 1, 0, 0, 0, 0, 0, ... A000007 %e A326475 [1] 1, -1, 19, -1513, 315523, -136085041, ... A002115 %e A326475 [2] 1, -2, 58, -6218, 1630330, -847053482, ... %e A326475 [3] 1, -3, 117, -15795, 4997781, -3042574083, ... %e A326475 [4] 1, -4, 196, -31924, 11840836, -8271354004, ... %e A326475 [5] 1, -5, 295, -56285, 23952055, -18889306805, ... %e A326475 [6] 1, -6, 414, -90558, 43493598, -38227720446, ... %t A326475 (* The function MLPower is defined in A326327. *) %t A326475 For[n = 0, n < 8, n++, Print[MLPower[3, -n, 8]]] %o A326475 (Sage) # uses[MLPower from A326327] %o A326475 for n in (0..6): print(MLPower(3, -n, 9)) %Y A326475 Rows: A000007, A002115. %Y A326475 Cf. A326476 (m=2, p>=0), A326327 (m=2, p<=0), A326474 (m=3, p>=0), this sequence (m=3, p<=0). %K A326475 sign,tabl %O A326475 0,8 %A A326475 _Peter Luschny_, Jul 08 2019