OFFSET
0,2
COMMENTS
For comments and a table of the polynomials see A397333, which is the main entry for this family of triangles.
FORMULA
T(n, k) = 2^(n - k) * t(n, k) where t(n, k) = t(n - 1, k - 1) + (n + 2*k + 1/2) * t(n - 1, k) + (n + k + 1/2) * (k + 1) * t(n - 1, k + 1) for 0 <= k < n, and t(n, n) = 1.
T(n, k) = 2^(n - k) * [x^k] b(n, n) where b(n, k) = (k + 1/2)*b(n-1, k) + x*b(n-1, k+1) if n > 0 and b(0, k) = 1.
EXAMPLE
Triangle starts:
[0] 1;
[1] 3, 1;
[2] 25, 12, 1;
[3] 343, 193, 27, 1;
[4] 6561, 4040, 730, 48, 1;
[5] 161051, 105121, 22230, 1970, 75, 1;
[6] 4826809, 3281908, 772891, 82880, 4355, 108, 1;
[7] 170859375, 119739649, 30506721, 3742291, 242725, 8435, 147, 1;
MAPLE
t := proc(n, k) option remember; if n = k then return 1 fi; if k < 0 or k > n then return 0 fi; t(n-1, k-1) + (n + 2*k + 1/2) * t(n - 1, k) + (n + k + 1/2) * (k + 1) * t(n-1, k+1) end: T := (n, k) -> 2^(n - k) * t(n, k):
# Alternative:
P := (n, k, x) -> local j; add((-1)^(k - j) * binomial(k, j) * (n + x + j)^n , j = 0..k) / k!: T := (n, k) -> 2^(n-k) * P(n, k, 1/2): seq(seq(T(n, k), k = 0..n), n = 0..9);
PROG
(SageMath)
R.<z> = ZZ[]
@cached_function
def b(a, n, k):
if n == 0: return R(1)
return (k + a)*b(a, n-1, k) + z*b(a, n-1, k+1)
def T_row(a, n) -> list[int]: return [2^(n - k) * c for k, c in enumerate(b(a, n, n))]
for n in range(8): print(T_row(1/2, n))
CROSSREFS
KEYWORD
AUTHOR
Peter Luschny, Jun 21 2026
STATUS
approved
