A054654 -id:A054654 - cp's OEIS frontend

A048994 Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.

1, 0, 1, 0, -1, 1, 0, 2, -3, 1, 0, -6, 11, -6, 1, 0, 24, -50, 35, -10, 1, 0, -120, 274, -225, 85, -15, 1, 0, 720, -1764, 1624, -735, 175, -21, 1, 0, -5040, 13068, -13132, 6769, -1960, 322, -28, 1, 0, 40320, -109584, 118124, -67284, 22449, -4536, 546, -36, 1, 0, -362880, 1026576, -1172700, 723680, -269325, 63273, -9450, 870, -45, 1

Offset: 0

N. J. A. Sloane

The unsigned numbers are also called Stirling cycle numbers: |s(n,k)| = number of permutations of n objects with exactly k cycles.
Mirror image of the triangle A054654. - Philippe Deléham, Dec 30 2006
Also the triangle gives coefficients T(n,k) of x^k in the expansion of C(x,n) = (a(k)*x^k)/n!. - Mokhtar Mohamed, Dec 04 2012
From Wolfdieter Lang, Nov 14 2018: (Start)
This is the Sheffer triangle of Jabotinsky type (1, log(1 + x)). See the e.g.f. of the triangle below.
This is the inverse Sheffer triangle of the Stirling2 Sheffer triangle A008275.
The a-sequence of this Sheffer triangle (see a W. Lang link in A006232)
is from the e.g.f. A(x) = x/(exp(x) -1) a(n) = Bernoulli(n) = A027641(n)/A027642(n), for n >= 0. The z-sequence vanishes.
The Boas-Buck sequence for the recurrences of columns has o.g.f. B(x) = Sum_{n>=0} b(n)*x^n = 1/((1 + x)*log(1 + x)) - 1/x. b(n) = (-1)^(n+1)*A002208(n+1)/A002209(n+1), b = {-1/2, 5/12, -3/8, 251/720, -95/288, 19087/60480,...}. For the Boas-Buck recurrence of Riordan and Sheffer triangles see the Aug 10 2017 remark in A046521, adapted to the Sheffer case, also for two references. See the recurrence and example below. (End)
Let G(n,m,k) be the number of simple labeled graphs on [n] with m edges and k components. Then T(n,k) = Sum (-1)^m*G(n,m,k). See the Read link below. Equivalently, T(n,k) = Sum mu(0,p) where the sum is over all set partitions p of [n] containing k blocks and mu is the Moebius function in the incidence algebra associated to the set partition lattice on [n]. - Geoffrey Critzer, May 11 2024

			Triangle begins:
  n\k 0     1       2       3      4      5      6    7    8   9 ...
  0   1
  1   0     1
  2   0    -1       1
  3   0     2      -3       1
  4   0    -6      11      -6      1
  5   0    24     -50      35    -10      1
  6   0  -120     274    -225     85    -15      1
  7   0   720   -1764    1624   -735    175    -21    1
  8   0 -5040   13068  -13132   6769  -1960    322  -28    1
  9   0 40320 -109584  118124 -67284  22449  -4536  546  -36   1
  ... - _Wolfdieter Lang_, Aug 22 2012
------------------------------------------------------------------
From _Wolfdieter Lang_, Nov 14 2018: (Start)
Recurrence: s(5,2)= s(4, 1) - 4*s(4, 2) = -6 - 4*11 = -50.
Recurrence from the a- and z-sequences: s(6, 3) = 2*(1*1*(-50) + 3*(-1/2)*35 + 6*(1/6)*(-10) + 10*0*1) = -225.
Boas-Buck recurrence for column k = 3, with b = {-1/2, 5/12, -3/8, ...}:
s(6, 3) = 6!*((-3/8)*1/3! + (5/12)*(-6)/4! + (-1/2)*35/5!) = -225. (End)

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 833.
L. Comtet, Advanced Combinatorics, Reidel, 1974; Chapter V, also p. 310.
J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 93.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 226.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 245.
J. Riordan, An Introduction to Combinatorial Analysis, p. 48.

T. D. Noe, Rows n=0..100 of triangle, flattened
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Paul Barry, Generalized Stirling Numbers, Exponential Riordan Arrays, and Toda Chain Equations, Journal of Integer Sequences, 17 (2014), #14.2.3.
Fatima Zohra Bensaci, Rachid Boumahdi, and Laala Khaldi, Finite Sums Involving Fibonacci and Lucas Numbers, J. Int. Seq. (2024). See p. 9.
R. M. Dickau, Stirling numbers of the first kind. [Illustrates the unsigned Stirling cycle numbers A132393.]
Askar Dzhumadil'daev and Damir Yeliussizov, Walks, partitions, and normal ordering, Electronic Journal of Combinatorics, 22(4) (2015), #P4.10.
Bill Gosper, Colored illustrations of triangle of Stirling numbers of first kind read mod 2, 3, 4, 5, 6, 7.
Gergő Nemes, An Asymptotic Expansion for the Bernoulli Numbers of the Second Kind, J. Int. Seq. 14 (2011), #11.4.8.
A. Hennessy and Paul Barry, Generalized Stirling Numbers, Exponential Riordan Arrays, and Orthogonal Polynomials, J. Int. Seq. 14 (2011), #11.8.2 (A-number typo A048894).
NIST Digital Library of Mathematical Functions, Stirling Numbers
Ken Ono, Larry Rolen, and Florian Sprung, Zeta-Polynomials for modular form periods, p. 6, arXiv:1602.00752 [math.NT], 2016.
Ricardo A. Podestá, New identities for binary Krawtchouk polynomials, binomial coefficients and Catalan numbers, arXiv preprint arXiv:1603.09156 [math.CO], 2016.
Ronald Read, An Introduction to Chromatic Polynomials, Journal of Combinatorial Theory, 4(1968)52-71.
Wikipedia, Stirling numbers and exponential generating functions.

See especially A008275 which is the main entry for this triangle. A132393 is an unsigned version, and A008276 is another version.
Cf. A008277, A039814-A039817, A048993, A084938.
A000142(n) = Sum_{k=0..n} |s(n, k)| for n >= 0.
Row sums give A019590(n+1).
Cf. A002209, A027641/A027642, A216294, A271705.

a048994 n k = a048994_tabl !! n !! k
a048994_row n = a048994_tabl !! n
a048994_tabl = map fst $ iterate (\(row, i) ->
(zipWith (-) ([0] ++ row) $ map (* i) (row ++ [0]), i + 1)) ([1], 0)
-- Reinhard Zumkeller, Mar 18 2013

A048994:= proc(n,k) combinat[stirling1](n,k) end: # R. J. Mathar, Feb 23 2009
seq(print(seq(coeff(expand(k!*binomial(x,k)),x,i),i=0..k)),k=0..9); # Peter Luschny, Jul 13 2009
A048994_row := proc(n) local k; seq(coeff(expand(pochhammer(x-n+1,n)), x,k), k=0..n) end: # Peter Luschny, Dec 30 2010

Table[StirlingS1[n, m], {n, 0, 9}, {m, 0, n}] (* Peter Luschny, Dec 30 2010 *)

create_list(stirling1(n,k),n,0,12,k,0,n); /* Emanuele Munarini, Mar 11 2011 */

a(n,k) = if(k<0 || k>n,0, if(n==0,1,(n-1)*a(n-1,k)+a(n-1,k-1)))

trg(nn)=for (n=0, nn-1, for (k=0, n, print1(stirling(n,k,1), ", ");); print();); \\ Michel Marcus, Jan 19 2015

s(n, k) = A008275(n,k) for n >= 1, k = 1..n; column k = 0 is {1, repeat(0)}.
s(n, k) = s(n-1, k-1) - (n-1)*s(n-1, k), n, k >= 1; s(n, 0) = s(0, k) = 0; s(0, 0) = 1.
The unsigned numbers a(n, k)=|s(n, k)| satisfy a(n, k)=a(n-1, k-1)+(n-1)*a(n-1, k), n, k >= 1; a(n, 0) = a(0, k) = 0; a(0, 0) = 1.
Triangle (signed) = [0, -1, -1, -2, -2, -3, -3, -4, -4, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, ...]; Triangle(unsigned) = [0, 1, 1, 2, 2, 3, 3, 4, 4, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, ...]; where DELTA is Deléham's operator defined in A084938.
Sum_{k=0..n} (-m)^(n-k)*s(n, k) = A000142(n), A001147(n), A007559(n), A007696(n), ... for m = 1, 2, 3, 4, ... .- Philippe Deléham, Oct 29 2005
A008275*A007318 as infinite lower triangular matrices. - Gerald McGarvey, Aug 20 2009
T(n,k) = n!*[x^k]([t^n]exp(x*log(1+t))). - Peter Luschny, Dec 30 2010, updated Jun 07 2020
From Wolfdieter Lang, Nov 14 2018: (Start)
Recurrence from the Sheffer a-sequence (see a comment above): s(n, k) = (n/k)*Sum_{j=0..n-k} binomial(k-1+j, j)*Bernoulli(j)*s(n-1, k-1+j), for n >= 1 and k >= 1, with s(n, 0) = 0 if n >= 1, and s(0,0) = 1.
Boas-Buck type recurrence for column k: s(n, k) = (n!*k/(n - k))*Sum_{j=k..n-1} b(n-1-j)*s(j, k)/j!, for n >= 1 and k = 0..n-1, with input s(n, n) = 1. For sequence b see the Boas-Buck comment above. (End)
T(n,k) = Sum_{j=k..n} (-1)^(n-j)*A271705(n,j)*A216294(j,k). - Mélika Tebni, Feb 23 2023

Offset corrected by R. J. Mathar, Feb 23 2009

Formula corrected by Philippe Deléham, Sep 10 2009

A008276 Triangle of Stirling numbers of first kind, s(n, n-k+1), n >= 1, 1 <= k <= n. Also triangle T(n,k) giving coefficients in expansion of n!*binomial(x,n)/x in powers of x.

Original entry on oeis.org

1, 1, -1, 1, -3, 2, 1, -6, 11, -6, 1, -10, 35, -50, 24, 1, -15, 85, -225, 274, -120, 1, -21, 175, -735, 1624, -1764, 720, 1, -28, 322, -1960, 6769, -13132, 13068, -5040, 1, -36, 546, -4536, 22449, -67284, 118124, -109584, 40320, 1, -45

Offset: 1

N. J. A. Sloane

n-th row of the triangle = charpoly of an (n-1) X (n-1) matrix with (1,2,3,...) in the diagonal and the rest zeros. - Gary W. Adamson, Mar 19 2009
From Daniel Forgues, Jan 16 2016: (Start)
For n >= 1, the row sums [of either signed or absolute values] are
  Sum_{k=1..n} T(n,k) = 0^(n-1),
  Sum_{k=1..n} |T(n,k)| = T(n+1,1) = n!. (End)
The moment generating function of the probability density function p(x, m=q, n=1, mu=q) = q^q*x^(q-1)*E(x, q, 1)/(q-1)!, with q >= 1, is M(a, m=q, n=1, mu=q) = Sum_{k=0..q}(A000312(q) / A000142(q-1)) * A008276(q, k) * polylog(k, a) / a^q , see A163931 and A274181. - Johannes W. Meijer, Jun 17 2016
Triangle of coefficients of the polynomial x(x-1)(x-2)...(x-n+1), also denoted as falling factorial (x)n, expanded into decreasing powers of x. - _Ralf Stephan, Dec 11 2016

			3!*binomial(x,3) = x*(x-1)*(x-2) = x^3 - 3*x^2 + 2*x.
Triangle begins
  1;
  1,  -1;
  1,  -3,   2;
  1,  -6,  11,   -6;
  1, -10,  35,  -50,  24;
  1, -15,  85, -225, 274, -120;
...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 833.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 226.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, 2nd ed. (Addison-Wesley, 1994), p. 257.

T. D. Noe, Rows n=0..100 of triangle, flattened
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
T. Copeland, Generators, Inversion, and Matrix, Binomial, and Integral Transforms
Yahia Djemmada, Abdelghani Mehdaoui, László Németh, and László Szalay, The Fibonacci-Fubini and Lucas-Fubini numbers, arXiv:2407.04409 [math.CO], 2024. See pp. 10, 12.
Bill Gosper, Colored illustrations of triangle of Stirling numbers of first kind read mod 2, 3, 4, 5, 6, 7
Eric Weisstein's World of Mathematics, Stirling Number of the First Kind
Wikipedia, Stirling numbers and exponential generating functions

See A008275 and A048994, which are the main entries for this triangle of numbers.
See A008277 triangle of Stirling numbers of the second kind, S2(n,k).
Cf. A054654, A054655, A084938, A145324, A094216, A003422, A000166, A000110, A000204, A000045, A000108.

a008276 n k = a008276_tabl !! (n-1) !! (k-1)
a008276_row n = a008276_tabl !! (n-1)
a008276_tabl = map init $ tail a054654_tabl
-- Reinhard Zumkeller, Mar 18 2014

seq(seq(coeff(expand(n!*binomial(x,n)),x,j),j=n..1,-1),n=1..15); # Robert Israel, Jan 24 2016
A008276 := proc(n, k): combinat[stirling1](n, n-k+1) end: seq(seq(A008276(n, k), k=1..n), n=1..9); # Johannes W. Meijer, Jun 17 2016

len = 47; m = Ceiling[Sqrt[2*len]]; t[n_, k_] = StirlingS1[n, n-k+1]; Flatten[Table[t[n, k], {n, 1, m}, {k, 1, n}]][[1 ;; len]] (* Jean-François Alcover, May 31 2011 *)
Flatten@Table[CoefficientList[Product[1-k x, {k, 1, n}], x], {n, 0, 8}] (* Oliver Seipel, Jun 14 2024 *)
Flatten@Table[Coefficient[Product[x-k, {k, 0, n-1}], x, Reverse@Range[n]], {n, Range[9]}] (* Oliver Seipel, Jun 14 2024, after  Ralf Stephan *)

T(n,k)=if(n<1,0,n!*polcoeff(binomial(x,n),n-k+1))

T(n,k)=if(n<1,0,n!*polcoeff(polcoeff(y*(1+y*x+x*O(x^n))^(1/y),n),k))

def T(n,k): return falling_factorial(x,n).expand().coefficient(x,n-k+1) # Ralf Stephan, Dec 11 2016

n!*binomial(x, n) = Sum_{k=1..n-1} T(n, k)*x^(n-k).
|A008276(n, k)| = T(n-1, k-1) where T(n, k) is the triangle, read by rows, given by [1, 0, 1, 0, 1, 0, 1, 0, 1, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, ...]; A008276(n, k) = T(n-1, k-1) where T(n, k) is the triangle, read by rows, given by [1, 0, 1, 0, 1, 0, 1, 0, 1, ...] DELTA [ -1, -1, -2, -2, -3, -3, -4, -4, -5, -5, ...]. Here DELTA is the operator defined in A084938. - Philippe Deléham, Dec 30 2003
|T(n, k)| = Sum_{m=0..n} A008517(k, m+1)*binomial(n+m, 2*(k-1)), n >= k >= 1. A008517 is the second-order Eulerian triangle. See the Graham et al. reference p. 257, eq. (6.44).
A094638 formula for unsigned T(n, k).
|T(n, k)| = Sum_{m=0..min(k-1, n-k)} A112486(k-1, m)*binomial(n-1, k-1+m) if n >= k >= 1, else 0. - Wolfdieter Lang, Sep 12 2005, see A112486.
|T(n, k)| = (f(n-1, k-1)/(2*(k-1))!)* Sum_{m=0..min(k-1, n-k)} A112486(k-1, m)*f(2*(k-1), k-1-m)*f(n-k, m) if n >= k >= 1, else 0, where f(n, k) stands for the falling factorial n*(n-1)*...*(n-(k-1)) and f(n, 0):=1. - Wolfdieter Lang, Sep 12 2005, see A112486.
With P(n,t) = Sum_{k=0..n-1} T(n,k+1) * t^k = (1-t)*(1-2*t)*...*(1-(n-1)t) and P(0,t) = 1, exp(P(.,t)*x) = (1+t*x)^(1/t) . Compare A094638. T(n,k+1) = (1/k!) (D_t)^k (D_x)^n ( (1+t*x)^(1/t) - 1 ) evaluated at t=x=0 . - Tom Copeland, Dec 09 2007
Product_{i=1..n} (x-i) = Sum_{k=0..n} T(n,k)*x^k. - Reinhard Zumkeller, Dec 29 2007
E.g.f.: Sum_{n>=0} (Sum_{k=0..n} T(n,n-k)*t^k)/n!) = Sum_{n>=0} (x)n * t^k/n! = exp(x * log(1+t)), with (x)_n the n-th falling factorial polynomial. - _Ralf Stephan, Dec 11 2016
Sum_{j=0..m} T(m, m-j)*s2(j+k+1, m) =  m^k, where s2(j, m) are Stirling numbers of the second kind. - Tony Foster III, Jul 25 2019
For n>=2, Sum_{k=1..n} k*T(n,k) = (-1)^(n-1)*(n-2)!. - Zizheng Fang, Dec 27 2020

A054651 Triangle T(n,k) read by rows giving coefficients in expansion of n! * Sum_{i=0..n} C(x,i) in descending powers of x.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 0, 5, 6, 1, -2, 11, 14, 24, 1, -5, 25, 5, 94, 120, 1, -9, 55, -75, 304, 444, 720, 1, -14, 112, -350, 1099, 364, 3828, 5040, 1, -20, 210, -1064, 3969, -4340, 15980, 25584, 40320, 1, -27, 366, -2646, 12873, -31563, 79064, 34236, 270576, 362880

Offset: 0

N. J. A. Sloane, Apr 17 2000

Apparently A190782 with reversed rows. - Mathew Englander, May 17 2014

			The first few polynomials are:
  1, 1+x, 2+x+x^2, 6+5*x+x^3, 24+14*x+11*x^2-2*x^3+x^4, ...
So the triangle begins:
  1;
  1,   1;
  1,   1,   2;
  1,   0,   5,     6;
  1,  -2,  11,    14,   24;
  1,  -5,  25,     5,   94,   120;
  1,  -9,  55,   -75,  304,   444,   720;
  1, -14, 112,  -350, 1099,   364,  3828,  5040;
  1, -20, 210, -1064, 3969, -4340, 15980, 25584, 40320;
  ...

T. D. Noe, Rows n = 0..100 of triangle, flattened

T(2*n,n) gives A347987.

Cf. A054649, A054655, A054654, A190782 .

c[n_, k_] := Product[n-i, {i, 0, k-1}]/k!; row[n_] := CoefficientList[ n!*Sum[c[x, k], {k, 0, n}], x] // Reverse; Table[ row[n], {n, 0, 9}] // Flatten  (* Jean-François Alcover, Oct 04 2012 *)

T(n, k) = Sum_{i=0..k} Stirling1(i+n-k,n-k)*n!/(i+n-k)!. - Igor Victorovich Statsenko, May 27 2024

Missing 0 corrected by Steve Marak - N. J. A. Sloane, Jul 27 2012

A054655 Triangle T(n,k) giving coefficients in expansion of n!*binomial(x-n,n) in powers of x.

Original entry on oeis.org

1, 1, -1, 1, -5, 6, 1, -12, 47, -60, 1, -22, 179, -638, 840, 1, -35, 485, -3325, 11274, -15120, 1, -51, 1075, -11985, 74524, -245004, 332640, 1, -70, 2086, -34300, 336049, -1961470, 6314664, -8648640, 1, -92, 3682, -83720, 1182769

Offset: 0

N. J. A. Sloane, Apr 18 2000

			Triangle begins:
  1;
  1,  -1;
  1,  -5,    6;
  1, -12,   47,    -60;
  1, -22,  179,   -638,    840;
  1, -35,  485,  -3325,  11274,   -15120;
  1, -51, 1075, -11985,  74524,  -245004,  332640;
  1, -70, 2086, -34300, 336049, -1961470, 6314664, -8648640;
  ...

Robert Israel, Table of n, a(n) for n = 0..10010 (rows 0 to 140, flattened).
Takao Komatsu, Some explicit values of a q-multiple zeta function at roots of unity, arXiv:2505.09357 [math.NT], 2025. See p. 10.

Cf. A000407, A054649, A054651, A054654, A008276.

a054655_row := proc(n) local k; seq(coeff(expand((-1)^n*pochhammer (n-x,n)),x,n-k),k=0..n) end: # Peter Luschny, Nov 28 2010

row[n_] := Table[ Coefficient[(-1)^n*Pochhammer[n - x, n], x, n - k], {k, 0, n}]; A054655 = Flatten[ Table[ row[n], {n, 0, 8}]] (* Jean-François Alcover, Apr 06 2012, after Maple *)

T(n,k)=polcoef(n!*binomial(x-n,n), n-k);

n!*binomial(x-n, n) = Sum_{k=0..n} T(n, k)*x^(n-k).
From Robert Israel, Jul 12 2016: (Start)
G.f.: Sum_{n>=0} Sum_{k=0..n} T(n,k)*x^n*y^k  = hypergeom([1, -1/(2*y), (1/2)*(-1+y)/y], [-1/y], -4*x*y).
E.g.f.: Sum_{n>=0} Sum_{k=0..n} T(n,k)*x^n*y^k/n! = (1+4*x*y)^(-1/2)*((1+sqrt(1+4*x*y))/2)^(1+1/y). (End)

A106800 Triangle of Stirling numbers of 2nd kind, S(n, n-k), n >= 0, 0 <= k <= n.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 6, 7, 1, 0, 1, 10, 25, 15, 1, 0, 1, 15, 65, 90, 31, 1, 0, 1, 21, 140, 350, 301, 63, 1, 0, 1, 28, 266, 1050, 1701, 966, 127, 1, 0, 1, 36, 462, 2646, 6951, 7770, 3025, 255, 1, 0, 1, 45, 750, 5880, 22827, 42525, 34105, 9330, 511, 1, 0

Offset: 0

N. J. A. Sloane

Triangle T(n,k), 0 <= k <= n, read by rows, given by [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] DELTA [0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, ...] where DELTA is the operator defined in A084938. - Philippe Deléham, May 19 2005

			From _Gheorghe Coserea_, Jan 30 2017: (Start)
Triangle starts:
  n\k  [0]  [1]   [2]    [3]    [4]    [5]    [6]   [7] [8] [9]
  [0]   1;
  [1]   1,   0;
  [2]   1,   1,    0;
  [3]   1,   3,    1,     0;
  [4]   1,   6,    7,     1,     0;
  [5]   1,  10,   25,    15,     1,     0;
  [6]   1,  15,   65,    90,    31,     1,     0;
  [7]   1,  21,  140,   350,   301,    63,     1,    0;
  [8]   1,  28,  266,  1050,  1701,   966,   127,    1,  0;
  [9]   1,  36,  462,  2646,  6951,  7770,  3025,  255,  1,  0;
  ...
(End)

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 835.
F. N. David, M. G. Kendall, and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 223.
Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 2, table 2.14.1 at page 24.

G. C. Greubel, Rows n = 0..50 of the triangle, flattened
A. Aboud, J.-P. Bultel, A. Chouria, J.-G. Luque, and O. Mallet, Bell polynomials in combinatorial Hopf algebras, arXiv preprint arXiv:1402.2960 [math.CO], 2014.
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
J. Fernando Barbero G., Jesús Salas, and Eduardo J. S. Villaseñor, Bivariate Generating Functions for a Class of Linear Recurrences. I. General Structure, arXiv:1307.2010 [math.CO], 2013.
Eric Weisstein's World of Mathematics, Bell Polynomial.

See A008277 and A048993, which are the main entries for this triangle of numbers.
The Stirling1 counterpart is A054654.
Row sum: A000110.
Column 0: A000012.
Column 1: A000217.
Main Diagonal: A000007.
1st minor diagonal: A000012.
2nd minor diagonal: A000225.
3rd minor diagonal: A000392.
Cf. A008278, A340556.

seq(seq(Stirling2(n, n-k), k=0..n), n=0..8); # Peter Luschny, Feb 21 2021

Table[ StirlingS2[n, m], {n, 0, 10}, {m, n, 0, -1}]//Flatten (* Robert G. Wilson v, Jan 30 2017 *)

N=11; x='x+O('x^N); t='t; concat(apply(p->Vec(p), Vec(serlaplace(exp(t*(exp(x)-1))))))  \\ Gheorghe Coserea, Jan 30 2017
{T(n, k) = my(A, B); if( n<0 || k>n, 0, A = B = exp(x + x * O(x^n)); for(i=1, n, A = x * A'); polcoeff(A / B, n-k))}; /* Michael Somos, Aug 16 2017 */

flatten([[stirling_number2(n, n-k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Sep 11 2021

A(x;t) = exp(t*(exp(x)-1)) = Sum_{n>=0} P_n(t) * x^n/n!, where P_n(t) = Sum_{k=0..n} T(n,k)*t^(n-k). - Gheorghe Coserea, Jan 30 2017
Also, P_n(t) * exp(t) = (t * d/dt)^n exp(t). - Michael Somos, Aug 16 2017
T(n, k) = Sum_{j=0..k} E2(k, j)*binomial(n + k - j, 2*k), where E2(k, j) are the second-order Eulerian numbers A340556. - Peter Luschny, Feb 21 2021

A126351 Triangle read by rows: matrix product of the Stirling numbers of the second kind with the binomial coefficients.

Original entry on oeis.org

1, 1, 2, 1, 5, 4, 1, 9, 19, 8, 1, 14, 55, 65, 16, 1, 20, 125, 285, 211, 32, 1, 27, 245, 910, 1351, 665, 64, 1, 35, 434, 2380, 5901, 6069, 2059, 128, 1, 44, 714, 5418, 20181, 35574, 26335, 6305, 256, 1, 54, 1110, 11130, 58107, 156660, 204205, 111645, 19171, 512

Offset: 1

Thomas Wieder, Dec 29 2006

Many well-known integer sequences arise from such a matrix product of combinatorial coefficients. In the present case we have as the first row A000079 = the powers of two = 2^n. As the second row we have A001047 = 3^n - 2^n. As the column sums we have 1,3,10,37,151,674,3263,17007,94828 we have A005493 = number of partitions of [n+1] with a distinguished block.

			Matrix begins:
1, 2, 4,  8, 16,  32,   64,  128,   256, ... A000079
0, 1, 5, 19, 65, 211,  665, 2059,  6305, ... A001047
0, 0, 1,  9, 55, 285, 1351, 6069, 26335, ... A016269
0, 0, 0,  1, 14, 125,  910, 5901, 35574, ... A025211
0, 0, 0,  0,  1,  20,  245, 2380, 20181, ...
0, 0, 0,  0,  0,   1,   27,  434,  5418, ...
0, 0, 0,  0,  0,   0,    1,   35,   714, ...
0, 0, 0,  0,  0,   0,    0,    1,    44, ...
0, 0, 0,  0,  0,   0,    0,    0,     1, ...
Triangle begins:
1;
1,  2;
1,  5,  4;
1,  9, 19,  8;
1, 14, 55, 65, 16;

Alois P. Heinz, Rows n = 1..100, flattened

Cf. A039810, A039814, A126350, A054654, A126353.

T:= (n, k)-> add(binomial(n-1, i-1) *Stirling2(i, n+1-k), i=1..n):
seq(seq(T(n, k), k=1..n), n=1..10);  # Alois P. Heinz, Sep 29 2011

T[n_, k_] := Sum[Binomial[n-1, i-1]*StirlingS2[i, n+1-k], {i, 1, n}]; Table[T[n, k], {n, 1, 10}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jan 08 2016, after Alois P. Heinz *)

(In Maple notation:) Matrix product B.A of matrix A[i,j]:=binomial(j-1,i-1) with i = 1 to p+1, j = 1 to p+1, p=8 and of matrix B[i,j]:=stirling2(j,i) with i from 1 to d, j from 1 to d, d=9.

T(n,k) = Sum_{i=1..n} C(n-1,i-1) * Stirling2(i, n+1-k). - Alois P. Heinz, Sep 29 2011

A126350 Triangle read by rows: matrix product of the binomial coefficients with the Stirling numbers of the second kind.

Original entry on oeis.org

1, 1, 2, 1, 5, 5, 1, 9, 22, 15, 1, 14, 61, 99, 52, 1, 20, 135, 385, 471, 203, 1, 27, 260, 1140, 2416, 2386, 877, 1, 35, 455, 2835, 9156, 15470, 12867, 4140, 1, 44, 742, 6230, 28441, 72590, 102215, 73681, 21147

Offset: 1

Thomas Wieder, Dec 29 2006

Many well-known integer sequences arise from such a matrix product of combinatorial coefficients. In the present case we have as the first row (not surprisingly) A000110 = Bell or exponential numbers: ways of placing n labeled balls into n indistinguishable boxes . As second row we have A033452 = "STIRLING" transform of squares A000290. As the column sums we have 1, 3, 11, 47, 227, 1215, 7107, 44959, 305091 which is A035009 = STIRLING transform of [1,1,2,4,8,16,32, ...].

			Matrix begins:
1 2 5 15 52 203  877  4140  21147
0 1 5 22 99 471 2386 12867  73681
0 0 1  9 61 385 2416 15470 102215
0 0 0  1 14 135 1140  9156  72590
0 0 0  0 1   20  260  2835  28441
0 0 0  0 0    1   27   455   6230
0 0 0  0 0    0    1    35    742
0 0 0  0 0    0    0     1     44
0 0 0  0 0    0    0     0      1

Cf. A039810, A039814, A126351, A054654, A126353.

Cf. A137597.

T:= (n, k)-> add(Stirling2(n, j)*binomial(j-1, n-k), j=n-k+1..n):
seq(seq(T(n, k), k=1..n), n=1..10);  # Alois P. Heinz, Sep 03 2019

T[dim_] := T[dim] = Module[{M}, M[n_, n_] = 1; M[, ] = 0; Do[M[n, k] = M[n-1, k-1] + (k+2) M[n-1, k] + (k+1) M[n-1, k+1], {n, 0, dim-1}, {k, 0, n-1}]; Array[M, {dim, dim}, {0, 0}]];
dim = 9;
Table[T[dim][[n]][[1 ;; n]] // Reverse, {n, 1, dim}] (* Jean-François Alcover, Jun 27 2019, from Sage *)

def A126350_triangle(dim): # rows in reversed order
    M = matrix(ZZ,dim,dim)
    for n in (0..dim-1): M[n,n] = 1
    for n in (1..dim-1):
        for k in (0..n-1):
            M[n,k] = M[n-1,k-1]+(k+2)*M[n-1,k]+(k+1)*M[n-1,k+1]
    return M
A126350_triangle(9) # Peter Luschny, Sep 19 2012

(In Maple notation:) Matrix product A.B of matrix A[i,j]:=binomial(j-1,i-1) with i = 1 to p+1, j = 1 to p+1, p=8 and of matrix B[i,j]:=stirling2(j,i) with i from 1 to d, j from 1 to d, d=9.

A126353 Triangle read by rows: matrix product of the Stirling numbers of the first kind with the binomial coefficients.

Original entry on oeis.org

1, 1, 0, 1, -1, 1, 1, -3, 5, -2, 1, -6, 17, -20, 9, 1, -10, 45, -100, 109, -44, 1, -15, 100, -355, 694, -689, 265, 1, -21, 196, -1015, 3094, -5453, 5053, -1854, 1, -28, 350, -2492, 10899, -29596, 48082, -42048, 14833

Offset: 1

Thomas Wieder, Dec 29 2006

Many well-known integer sequences arise from such a matrix product of combinatorial coefficients. In the present case we have as the first row A000166 = subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.

			Matrix begins:
1 0 1 -2 9 -44 265 -1854 14833
0 1 -1 5 -20 109 -689 5053 -42048
0 0 1 -3 17 -100 694 -5453 48082
0 0 0 1 -6 45 -355 3094 -29596
0 0 0 0 1 -10 100 -1015 10899
0 0 0 0 0 1 -15 196 -2492
0 0 0 0 0 0 1 -21 350
0 0 0 0 0 0 0 1 -28
0 0 0 0 0 0 0 0 1

Signed version of A094791 [from Olivier Gérard, Jul 31 2011]

Cf. A039810, A039814, A126350, A126351, A054654.

(In Maple notation:) Matrix product B.A of matrix A[i,j]:=binomial(j-1,i-1) with i = 1 to p+1, j = 1 to p+1, p=8 and of matrix B[i,j]:=stirling1(j,i) with i from 1 to d, j from 1 to d, d=9.

A213167 a(n) = n! - (n-2)!.

Original entry on oeis.org

1, 5, 22, 114, 696, 4920, 39600, 357840, 3588480, 39553920, 475372800, 6187104000, 86699289600, 1301447347200, 20835611596800, 354379753728000, 6381450915840000, 121289412980736000, 2426499634470912000

Offset: 2

Olivier Gérard, Nov 02 2012

Row sums of A134433 starting from k=3.
a(n) = sum( (-1)^k*k*A008276(n,k), k=1..n-1).
a(n) = sum( (-1)^k*k*A054654(n,k), k=1..n-2).
For n >= 3, a(n) = number whose factorial base representation (A007623) begins with digits {n-1} and {n-2} followed by n-3 zeros. Viewed in that base, this sequence looks like this: 1, 21, 320, 4300, 54000, 650000, 7600000, 87000000, 980000000, A900000000, BA000000000, ... (where "digits" A and B stand for placeholder values 10 and 11 respectively). - Antti Karttunen, May 07 2015.

Index entries for sequences related to factorial base representation

Column 4 of A257503 (apart from initial 1. Equally, row 4 of A257505).
Cf. A000142, A007623, A134433.
Cf. A008276, A094638, A008275, A130534.
Cf. A054654, A048994, A132393.
Cf. A067318.

Table[n! - (n - 2)!, {n, 2, 20}]
#[[3]]-#[[1]]&/@Partition[Range[0,20]!,3,1] (* Harvey P. Dale, Aug 10 2023 *)

A213167(n):=n!-(n-2)!$
makelist(A213167(n),n,2,30); /* Martin Ettl, Nov 03 2012 */

(define (A213167 n) (- (A000142 n) (A000142 (- n 2)))) ;; Antti Karttunen, May 07 2015

a(n) = n! - (n-2)!.
G.f.: (1/G(0) - 1 - x)/x^2 where G(k) = 1 - x/(x - 1/(x - (k+1)/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Dec 13 2012
G.f.: (1+x)/x^2*(1/Q(0)-1), where Q(k)= 1 - 2*k*x - x^2*(k + 1)^2/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 08 2013
G.f.: 2*Q(0), where Q(k)= 1 - 1/( (k+1)*(k+2) - x*(k+1)^2*(k+2)^2*(k+3)/(x*(k+1)*(k+2)*(k+3) - 1/Q(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 08 2013

cp's OEIS Frontend

A048994 Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Maxima

PARI

PARI

Formula

Extensions

A008276 Triangle of Stirling numbers of first kind, s(n, n-k+1), n >= 1, 1 <= k <= n. Also triangle T(n,k) giving coefficients in expansion of n!*binomial(x,n)/x in powers of x.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Sage

Formula

A054651 Triangle T(n,k) read by rows giving coefficients in expansion of n! * Sum_{i=0..n} C(x,i) in descending powers of x.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A054655 Triangle T(n,k) giving coefficients in expansion of n!*binomial(x-n,n) in powers of x.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A106800 Triangle of Stirling numbers of 2nd kind, S(n, n-k), n >= 0, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

A126351 Triangle read by rows: matrix product of the Stirling numbers of the second kind with the binomial coefficients.

Views

Author

Keywords

Comments