OFFSET
1,2
COMMENTS
T(n, m) = R_n^m(a=0, b=10) in the notation of the given reference.
T(n, m) is a Jabotinsky matrix, i.e., the monic row polynomials E(n, x) = sum(T(n, m)*x^m, m=1..n) = product(x-10*j, j=0..n-1), n >= 1, E(0, x) = 1, are exponential convolution polynomials (see A039692 for the definition and a Knuth reference).
Also the Bell transform of the sequence (-1)^n*A051262(n) without column 0. For the definition of the Bell transform see A264428. - Peter Luschny, Jan 28 2016
LINKS
D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 77 (1962), 1-77.
FORMULA
T(n, m) = T(n-1, m-1) - 10*(n-1)*T(n-1, m), n >= m >= 1; T(n, m) = 0, n < m; T(n, 0) = 0, T(1, 1) = 1. E.g.f. for m-th column of signed triangle: (((log(1+10*x))/10)^m)/m!.
EXAMPLE
Triangle begins:
{1};
{-10,1};
{200,-30,1};
{-6000,1100,-60,1};
...
E(3,x) = 200*x-30*x^2+x^3.
MAPLE
# The function BellMatrix is defined in A264428.
# Adds (1, 0, 0, 0, ..) as column 0.
BellMatrix(n -> (-1)^n*n!*10^n, 9); # Peter Luschny, Jan 28 2016
MATHEMATICA
rows = 9;
t = Table[(-1)^n*n!*10^n, {n, 0, rows}];
T[n_, k_] := BellY[n, k, t];
Table[T[n, k], {n, 1, rows}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jun 22 2018, after Peter Luschny *)
CROSSREFS
First (m=1) (unsigned) column sequence is: A051262(n-1). Row sums (signed triangle): A049212(n-1)*(-1)^(n-1). Row sums (unsigned triangle): A045757(n).
KEYWORD
AUTHOR
EXTENSIONS
Name changed by Thomas Scheuerle, Feb 05 2026
STATUS
approved
