OFFSET
0,13
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, ...
-1, -1, -1, -1, -1, ...
0, -1, -3, -7, -15, ...
-1, -2, -6, -20, -66, ...
1, 2, 6, 20, 66, ...
MAPLE
b:= proc(n, i, k) option remember; (m->
`if`(m<n, 0, `if`(n=m, i!^k, b(n, i-1, k)+
`if`(i>n, 0, i^k*b(n-i, i-1, k)))))(i*(i+1)/2)
end:
A:= proc(n, k) option remember; `if`(n=0, 1,
-add(b(n-i$2, k)*A(i, k), i=0..n-1))
end:
seq(seq(A(n, d-n), n=0..d), d=0..12); # Alois P. Heinz, Sep 12 2017
MATHEMATICA
b[n_, i_, k_] := b[n, i, k] = If[# < n, 0, If[n == #, i!^k, b[n, i-1, k] + If[i > n, 0, i^k b[n-i, i-1, k]]]]&[i(i+1)/2];
A[n_, k_] := A[n, k] = If[n == 0, 1, -Sum[b[n-i, n-i, k] A[i, k], {i, 0, n-1}]];
Table[A[n, d-n], {d, 0, 12}, {n, 0, d}] // Flatten (* Jean-François Alcover, Nov 20 2019, after Alois P. Heinz *)
PROG
(Python)
from sympy.core.cache import cacheit
from sympy import factorial as f
@cacheit
def b(n, i, k):
m=i*(i + 1)/2
return 0 if m<n else f(i)**k if n==m else b(n, i - 1, k) + (0 if i>n else i**k*b(n - i, i - 1, k))
@cacheit
def A(n, k): return 1 if n==0 else -sum([b(n - i, n - i, k)*A(i, k) for i in range(n)])
for d in range(13): print([A(n, d - n) for n in range(d + 1)]) # Indranil Ghosh, Sep 14 2017, after Maple program
CROSSREFS
KEYWORD
sign,tabl
AUTHOR
Seiichi Manyama, Sep 12 2017
STATUS
approved