login
A051523
Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 9.
14
1, -10, 1, 110, -21, 1, -1320, 362, -33, 1, 17160, -6026, 791, -46, 1, -240240, 101524, -17100, 1435, -60, 1, 3603600, -1763100, 358024, -38625, 2335, -75, 1, -57657600, 31813200, -7491484, 976024, -75985, 3535, -91, 1, 980179200, -598482000, 159168428, -24083892, 2267769, -136080, 5082, -108, 1
OFFSET
0,2
COMMENTS
T(n, m) = ^10P_n^m in the notation of the given reference with T(0, 0) = 1.
The monic row polynomials s(n, x) = Sum_{m=0..n} T(n, m)*x^m which are s(n, x) = Product_{k=0..n-1} x-(10+k), n >= 1 and s(0, x) = 1 satisfy s(n, x+y) = Sum_{k=0..n} binomial(n, k)*s(k, x)*S1(n-k, y), with the Stirling1 polynomials S1(n, x) = Sum_{m=1..n} A008275(n, m)*x^m and S1(0, x) = 1. In the umbral calculus (see the S. Roman reference given in A048854) the s(n, x) polynomials are called Sheffer for (exp(10*t), exp(t)-1).
LINKS
D. S. Mitrinovic, M. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Pubi. Elektrotehn. Fak. Ser. Mat. Fiz. 77 (1962).
FORMULA
T(n, m) = T(n-1, m-1) - (n+9)*T(n-1, m), n >= m >= 0; T(n, m) = 0, n < m; T(n, -1) = 0, T(0, 0) = 1.
E.g.f. for m-th column of signed triangle: ((log(1+x))^m)/(m!*(1+x)^10).
Triangle (signed) = [ -10, -1, -11, -2, -12, -3, -13, -14, -4, ...] DELTA A000035; triangle (unsigned) = [10, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, ...] DELTA A000035; where DELTA is Deléham's operator defined in A084938.
If we define f(n, i, a) = Sum_{k=0..n-i} binomial(n,k)*stirling1(n-k,i)*Product_{j=0..k-1}(-a-j), then T(n, i) = f(n, i, 10), for n=1,2,...; i=0..n. Milan Janjic, Dec 21 2008
EXAMPLE
The triangle begins:
1;
-10, 1;
110, -21, 1;
-1320, 362, -331; 1;
...
s(2, x)= 110-21*x+x^2; S1(2, x)= -x+x^2 (Stirling1).
MATHEMATICA
a[n_, m_] := Pochhammer[m + 1, n - m] SeriesCoefficient[Log[1 + x]^m/(1 + x)^10, {x, 0, n}];
Table[a[n, m], {n, 0, 8}, {m, 0, n}] // Flatten (* Jean-François Alcover, Oct 29 2019 *)
PROG
(Haskell)
a051523 n k = a051523_tabl !! n !! k
a051523_row n = a051523_tabl !! n
a051523_tabl = map fst $ iterate (\(row, i) ->
(zipWith (-) ([0] ++ row) $ map (* i) (row ++ [0]), i + 1)) ([1], 10)
-- Reinhard Zumkeller, Mar 12 2014
CROSSREFS
The first (m=0) unsigned column sequence is A049398. Row sums (signed triangle): A049389(n)*(-1)^n. Row sums (unsigned triangle): A051431(n).
Similar generalizations: A049444 (r=1), A049458 (r=2), A049459 (r=3), A049460 (r=4), A051338 (r=5), A051339 (r=6), A051379 (r=7), A051390 (r=8).
Sequence in context: A333685 A288050 A288503 * A181868 A287494 A287753
KEYWORD
sign,easy,tabl
EXTENSIONS
Name changed by Thomas Scheuerle, Feb 06 2026
STATUS
approved