cp's OEIS Frontend

This triangle is an unsigned version of the triangle of Stirling numbers of the first kind, A008275, which is the main entry for these numbers. - N. J. A. Sloane, Jan 25 2011

Or, triangle T(n,k), 0 <= k <= n, read by rows given by [1,1,2,2,3,3,4,4,5,5,6,6,...] DELTA [1,0,1,0,1,0,1,0,1,0,1,0,...] where DELTA is the operator defined in A084938.

Reversal of A094638.

Equals A132393*A007318, as infinite lower triangular matrices. - Philippe Deléham, Nov 13 2007

From Johannes W. Meijer, Oct 07 2009: (Start)

The higher order exponential integrals E(x,m,n) are defined in A163931. The asymptotic expansion of the exponential integrals E(x,m=1,n) ~ (exp(-x)/x)*(1 - n/x + n*(n+1)/x^2 - n*(n+1)*(n+2)/x^3 + ...), see Abramowitz and Stegun. This formula follows from the general formula for the asymptotic expansion, see A163932. We rewrite E(x,m=1,n) ~ (exp(-x)/x)*(1 - n/x + (n^2+n)/x^2 - (2*n+3*n^2+n^3)/x^3 + (6*n+11*n^2+6*n^3+n^4)/x^3 - ...) and observe that the T(n,m) are the polynomials coefficients in the denominators. Looking at the a(n,m) formula of A028421, A163932 and A163934, and shifting the offset given above to 1, we can write T(n-1,m-1) = a(n,m) = (-1)^(n+m)*Stirling1(n,m), see the Maple program.

The asymptotic expansion leads for values of n from one to eleven to known sequences, see the cross-references. With these sequences one can form the triangles A008279 (right-hand columns) and A094587 (left-hand columns).

See A163936 for information about the o.g.f.s. of the right-hand columns of this triangle.

(End)

The number of elements greater than i to the left of i in a permutation gives the i-th element of the inversion vector. (Skiena-Pemmaraju 2003, p. 69.) T(n,k) is the number of n-permutations that have exactly k 0's in their inversion vector. See evidence in Mathematica code below. - Geoffrey Critzer, May 07 2010

T(n,k) counts the rooted trees with k+1 trunks in forests of "naturally grown" rooted trees with n+2 nodes. This corresponds to sums of coefficients of iterated derivatives representing vectors, Lie derivatives, or infinitesimal generators for flow fields and formal group laws. Cf. links in A139605. - Tom Copeland, Mar 23 2014

A refinement is A036039. - Tom Copeland, Mar 30 2014

From Tom Copeland, Apr 05 2014: (Start)

With initial n=1 and row polynomials of T as p(n,x)=x(x+1)...(x+n-1), the powers of x correspond to the number of trunks of the rooted trees of the "naturally-grown" forest referred to above. With each trunk allowed m colors, p(n,m) gives the number of such non-plane colored trees for the forest with each tree having n+1 vertices.

p(2,m) = m + m^2 = A002378(m) = 2*A000217(m) = 2*(first subdiag of |A238363|).

p(3,m) = 2m + 3m^2 + m^3 = A007531(m+2) = 3*A007290(m+2) = 3*(second subdiag A238363).

p(4,m) = 6m + 11m^2 + 6m^3 + m^4 = A052762(m+3) = 4*A033487(m) = 4*(third subdiag).

From the Joni et al. link, p(n,m) also represents the disposition of n distinguishable flags on m distinguishable flagpoles.

The chromatic polynomial for the complete graph K_n is the falling factorial, which encodes the colorings of the n vertices of K_n and gives a shifted version of p(n,m).

E.g.f. for the row polynomials: (1-y)^(-x).

(End)

A relation to derivatives of the determinant |V(n)| of the n X n Vandermonde matrix V(n) in the indeterminates c(1) thru c(n):

|V(n)| = Product_{1<=jTom Copeland, Apr 10 2014

From Peter Bala, Jul 21 2014: (Start)

Let M denote the lower unit triangular array A094587 and for k = 0,1,2,... define M(k) to be the lower unit triangular block array

/I_k 0\

\ 0 M/

having the k X k identity matrix I_k as the upper left block; in particular, M(0) = M. Then the present triangle equals the infinite matrix product M(0)*M(1)*M(2)*... (which is clearly well defined). See the Example section. (End)

For the relation of this rising factorial to the moments of Viennot's Laguerre stories, see the Hetyei link, p. 4. - Tom Copeland, Oct 01 2015

Can also be seen as the Bell transform of n! without column 0 (and shifted enumeration). For the definition of the Bell transform see A264428. - Peter Luschny, Jan 27 2016

From Wolfdieter Lang, Jun 27 2012: (Start)

T(n-1,k), k=1,...,n-1, gives the number of representative necklaces with n beads (C_N symmetry) of n+1-k distinct colors, say c[1],c[2],...,c[n-k+1], corresponding to the color signature determined by the partition k,1^(n-k) of n. The representative necklaces have k beads of color c[1]. E.g., n=4, k=2: partition 2,1,1, color signature (parts as exponents) c[1]c[1]c[2]c[3], 3=T(3,2) necklaces (write j for color c[j]): cyclic(1123), cyclic(1132) and cyclic(1213). See A212359 for the numbers for general partitions or color signatures. (End)

row(0) = {1}; row(n+1) = row(n) multiplied by n and prepended with (n+1);

A111063(n+1) = sum of n-th row;

T(2*n,n) = A002690(n), central terms;

T(n,0) = n + 1;

T(n,1) = A000290(n), n > 0;

T(n,2) = A011379(n-1), n > 1;

T(n,3) = A047927(n), n > 2;

T(n,4) = A192849(n-1), n > 3;

T(n,5) = A000142(5) * A027810(n-5), n > 4;

T(n,6) = A000142(6) * A027818(n-6), n > 5;

T(n,7) = A000142(7) * A056001(n-7), n > 6;

T(n,8) = A000142(8) * A056003(n-8), n > 7;

T(n,9) = A000142(9) * A056114(n-9), n > 8;

T(n,n-10) = 11 * A051431(n-10), n > 9;

T(n,n-9) = 10 * A049398(n-9), n > 8;

T(n,n-8) = 9 * A049389(n-8), n > 7;

T(n,n-7) = 8 * A049388(n-7), n > 6;

T(n,n-6) = 7 * A001730(n), n > 5;

T(n,n-5) = 6 * A001725(n), n > 5;

T(n,n-4) = 5 * A001720(n), n > 4;

T(n,n-3) = 4 * A001715(n), n > 2;

T(n,n-2) = A070960(n), n > 1;

T(n,n-1) = A052849(n), n > 0;

T(n,n) = A000142(n);

T(n,k) = A137948(n,k) * A007318(n,k), 0 <= k <= n.

The asymptotic expansion of the higher order exponential integral E(x,m=2,n=10) ~ exp(-x)/x^2*(1 - 21/x + 362/x^2 - 6026/x^3 + 101524/x^4 - 1763100/x^5 + 31813200/x^6 - ...) leads to the sequence given above. See A163931 and A028421 for more information. - Johannes W. Meijer, Oct 20 2009

The p=10 member of the p-family of sequences {(n+p-1)!/p!}, n >= 1.

The asymptotic expansion of the higher-order exponential integral E(x,m=1,n=11) ~ exp(-x)/x*(1 - 11/x + 132/x^2 - 1716/x^3 + 24024/x^4 - 360360/x^5 + 5765760/x^6 - ...) leads to the sequence given above. See A163931 and A130534 for more information. - Johannes W. Meijer, Oct 20 2009

From Wolfdieter Lang, Jun 20 2011: (Start)

The row polynomials s(n,x) := Sum_{j=0..n} T(n,k)*x^k satisfy risefac(x-1,n) = s(n,x), with the rising factorials risefac(x-1,n) := Product_{j=0..n-1} (x-1+j), n >= 1, risefac(x-1,0) = 1. Compare with the formula risefac(x,n) = s1(n,x), with the row polynomials s1(n,x) of A132393 (unsigned Stirling1).

This is the lower triangular Sheffer array with e.g.f.

T(x,z) = (1-z)*exp(-x*log(1-z)) (the rewritten e.g.f. from the formula section). See the W. Lang link under A006232 for Sheffer matrices and the Roman reference. In the notation which indicates the column e.g.f.s this is Sheffer (1-z,-log(1-z)). In the umbral notation (cf. Roman) this is called Sheffer for (exp(t),1-exp(-t)).

The row polynomials satisfy s(n,x) = (x+n-1)*s(n-1,x), s(0,x)=1, and s(n,x) = (x-1)*s1(n-1,x), n >= 1, s1(0,x) = 1, with the unsigned Stirling1 row polynomials s1(n,x).

The row polynomials also satisfy

s(n,x) - s(n,x-1) = n*s(n-1,x), n > 1, s(0,x) = 1

(from the Meixner identity, see the Meixner reference given at A060338).

The row polynomials satisfy as well (from corollary 3.7.2. p. 50 of the Roman reference)

s(n,x) = (x-1)*s(n-1,x+1), n >= 1, s(0,n) = 1.

The exponential convolution identity is

s(n,x+y) = Sum_{k=0..n} binomial(n,k)*s(k,y)*s1(n-k,x),

n >= 0, with symmetry x <-> y.

The row sums are 1 for n=0 and 0 otherwise, and the alternating row sums are 1,-2,2, followed by zeros, with e.g.f. (1-x)^2.

The Sheffer a-sequence Sha(n) = A164555(n)/A027642(n) with e.g.f. x/(1-exp(-x)), and the z-sequence is Shz(n) = -1 with e.g.f. -exp(x).

The inverse Sheffer matrix is ((-1)^(n-k))*A105794(n,k) with e.g.f. exp(z)*exp(x*(1-exp(-z))). (End)

Triangle T(n,k), read by rows, given by (-1, 1, 0, 2, 1, 3, 2, 4, 3, 5, ...) DELTA (1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Jan 16 2012

Also coefficients of t in t*(t-1)*Sum[(-1)^(n+m) t^(m-1) StirlingS1[n,m], {m,n}] in which setting t^k equal to k gives n!, from this follows that the dot product of row n with [0,...,n] equals (n-1)!. - Wouter Meeussen, May 15 2012

a(n,m)= ^9P_n^m in the notation of the given reference with a(0,0) := 1. The monic row polynomials s(n,x) := sum(a(n,m)*x^m,m=0..n) which are s(n,x)= product(x-(9+k),k=0..n-1), n >= 1 and s(0,x)=1 satisfy s(n,x+y) = sum(binomial(n,k)*s(k,x)*S1(n-k,y),k=0..n), with the Stirling1 polynomials S1(n,x)=sum(A008275(n,m)*x^m, m=1..n) 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(9*t),exp(t)-1).