OFFSET
0,9
FORMULA
T(n, k) = (-1)^(k + 1) * k^(n - k) * Gamma(k, -k) / exp(k) for k > 0.
T(n, k) = (-1)^(n + 1) * Sum_{i=1..k}((-k)^(n - i) * (k - 1)! / (k - i)!) for k > 0.
EXAMPLE
Triangle starts:
[0] [1]
[1] [0, 1]
[2] [0, 1, 1]
[3] [0, 1, 2, 5]
[4] [0, 1, 4, 15, 34]
[5] [0, 1, 8, 45, 136, 329]
[6] [0, 1, 16, 135, 544, 1645, 4056]
[7] [0, 1, 32, 405, 2176, 8225, 24336, 60997]
[8] [0, 1, 64, 1215, 8704, 41125, 146016, 426979, 1082320]
[9] [0, 1, 128, 3645, 34816, 205625, 876096, 2988853, 8658560, 22137201]
MAPLE
T := (n, k) -> local i; ifelse(n = 0, 1, -(-1)^n * add((-k)^(n-i) * pochhammer(k-i+1, i-1), i = 1..k)): seq(print(seq(T(n, k), k = 0..n)), n = 0..9);
MATHEMATICA
T[n_, k_] = If[k == 0, Boole[k == n], k^(n-1)*HypergeometricPFQ[{1, 1 - k}, {}, 1/k]];
Table[T[n, k], {n, 0, 9}, {k, 0, n}] // MatrixForm
PROG
(Python)
from math import perm
def T(n: int, k: int) -> int:
if k == 0: return k**n
return (-1)**(n+1) * sum((-k)**(n-i) * perm(k-1, i-1) for i in range(1, k+1))
(Python) # efficient iterative variant
def T(n: int, k: int) -> int:
if k == 0: return 1 if n == 0 else 0
q, p = 1, 1
for m in range(1, k):
p *= -k
q = p + m * q
nk = 1
for _ in range(n - k): nk *= k
sign = 1 if k % 2 == 1 else -1
return sign * nk * q
for n in range(10): print([T(n, k) for k in range(0, n+1)])
(Python) # extreme edition
from mpmath import mp, gammainc, exp, nint
def T(n: int, k: int) -> int:
if k == 0: return k**n
mp.dps = 50
val = (-1)**(k+1) * k**(n-k) * gammainc(k, -k) / exp(k)
return int(nint(val))
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Peter Luschny, Mar 09 2026
STATUS
approved
