A254882 -id:A254882 - cp's OEIS frontend

A111596 The matrix inverse of the unsigned Lah numbers A271703.

1, 0, 1, 0, -2, 1, 0, 6, -6, 1, 0, -24, 36, -12, 1, 0, 120, -240, 120, -20, 1, 0, -720, 1800, -1200, 300, -30, 1, 0, 5040, -15120, 12600, -4200, 630, -42, 1, 0, -40320, 141120, -141120, 58800, -11760, 1176, -56, 1, 0, 362880, -1451520, 1693440, -846720, 211680, -28224, 2016, -72, 1

Offset: 0

Wolfdieter Lang, Aug 23 2005

Also the associated Sheffer triangle to Sheffer triangle A111595.
Coefficients of Laguerre polynomials (-1)^n * n! * L(n,-1,x), which equals (-1)^n * Lag(n,x,-1) below. Lag(n,Lag(.,x,-1),-1) = x^n evaluated umbrally, i.e., with (Lag(.,x,-1))^k = Lag(k,x,-1). - Tom Copeland, Apr 26 2014
Without row n=0 and column m=0 this is, up to signs, the Lah triangle A008297.
The unsigned column sequences are (with leading zeros): A000142, A001286, A001754, A001755, A001777, A001778, A111597-A111600 for m=1..10.
The row polynomials p(n,x) := Sum_{m=0..n} a(n,m)*x^m, together with the row polynomials s(n,x) of A111595 satisfy the exponential (or binomial) convolution identity s(n,x+y) = Sum_{k=0..n} binomial(n,k)*s(k,x)*p(n-k,y), n>=0.
Exponential Riordan array [1,x/(1+x)]. Inverse of the exponential Riordan array [1,x/(1-x)], which is the unsigned version of A111596. - Paul Barry, Apr 12 2007
For the unsigned subtriangle without column number m=0 and row number n=0, see A105278.
Unsigned triangle also matrix product |S1|*S2 of Stirling number matrices.
The unsigned row polynomials are Lag(n,-x,-1), the associated Laguerre polynomials of order -1 with negated argument. See Gradshteyn and Ryzhik, Abramowitz and Stegun and Rota (Finite Operator Calculus) for extensive formulas. - Tom Copeland, Nov 17 2007, Sep 09 2008
An infinitesimal matrix generator for unsigned A111596 is given by A132792. - Tom Copeland, Nov 22 2007
From the formalism of A132792 and A133314 for n > k, unsigned A111596(n,k) = a(k) * a(k+1)...a(n-1) / (n-k)! = a generalized factorial, where a(n) = A002378(n) = n-th term of first subdiagonal of unsigned A111596. Hence Deutsch's remark in A002378 provides an interpretation of A111596(n,k) in terms of combinations of certain circular binary words. - Tom Copeland, Nov 22 2007
Given T(n,k)= A111596(n,k) and matrices A and B with A(n,k) = T(n,k)*a(n-k) and B(n,k) = T(n,k)*b(n-k), then A*B = C where C(n,k) = T(n,k)*[a(.)+b(.)]^(n-k), umbrally. - Tom Copeland, Aug 27 2008
Operationally, the unsigned row polynomials may be expressed as p_n(:xD:) = x*:Dx:^n*x^{-1}=x*D^nx^n*x^{-1}= n!*binomial(xD+n-1,n) = (-1)^n n! binomial(-xD,n) = n!L(n,-1,-:xD:), where, by definition, :AB:^n = A^nB^n for any two operators A and B, D = d/dx, and L(n,-1,x) is the Laguerre polynomial of order -1. A similarity transformation of the operators :Dx:^n generates the higher order Laguerre polynomials, which can also be expressed in terms of rising or falling factorials or Kummer's confluent hypergeometric functions (cf. the Mathoverflow post). -  Tom Copeland, Sep 21 2019

			Binomial convolution of row polynomials: p(3,x) = 6*x-6*x^2+x^3; p(2,x) = -2*x+x^2, p(1,x) = x, p(0,x) = 1,
together with those from A111595: s(3,x) = 9*x-6*x^2+x^3; s(2,x) = 1-2*x+x^2, s(1,x) = x, s(0,x) = 1; therefore
9*(x+y)-6*(x+y)^2+(x+y)^3 = s(3,x+y) = 1*s(0,x)*p(3,y) + 3*s(1,x)*p(2,y) + 3*s(2,x)*p(1,y) +1*s(3,x)*p(0,y) = (6*y-6*y^2+y^3) + 3*x*(-2*y+y^2) + 3*(1-2*x+x^2)*y + 9*x-6*x^2+x^3.
From _Wolfdieter Lang_, Apr 28 2014: (Start)
The triangle a(n,m) begins:
n\m  0     1       2       3      4     5   6  7
0:   1
1:   0     1
2:   0    -2       1
3:   0     6      -6       1
4:   0   -24      36     -12      1
5:   0   120    -240     120    -20     1
6:   0  -720    1800   -1200    300   -30   1
7:   0  5040  -15120   12600  -4200   630 -42  1
...
For more rows see the link.
(End)

G. C. Greubel, Rows n=0..100 of triangle, flattened
Wolfdieter Lang, The first 11 rows of the triangle.
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, The Restricted Toda Chain, Exponential Riordan Arrays, and Hankel Transforms, J. Int. Seq. 13 (2010) # 10.8.4, example 4.
Paul Barry, Exponential Riordan Arrays and Permutation Enumeration, J. Int. Seq. 13 (2010) # 10.9.1, example 6.
Paul Barry, Riordan Arrays, Orthogonal Polynomials as Moments, and Hankel Transforms, J. Int. Seq. 14 (2011) # 11.2.2, example 20.
Paul Barry, Combinatorial polynomials as moments, Hankel transforms and exponential Riordan arrays, arXiv preprint arXiv:1105.3044 [math.CO], 2011, also J. Int. Seq. 14 (2011) 11.6.7.
Tom Copeland, A Class of Differential Operators and the Stirling Numbers; Generators, Inversion, and Matrix, Binomial, and Integral Transforms; Lagrange a la Lah
A. Hennessy and P. Barry, Generalized Stirling Numbers, Exponential Riordan Arrays, and Orthogonal Polynomials, J. Int. Seq. 14 (2011) # 11.8.2.
M. Janjic, Some classes of numbers and derivatives, JIS 12 (2009) 09.8.3.
Mathoverflow, Pochhammer symbol of a differential, and hypergeometric polynomials, a question posed by Emilio Pisanty and answered by Tom Copeland, 2012.
J. Taylor, Counting words with Laguerre polynomials, DMTCS Proc., Vol. AS, 2013, p. 1131-1142. [_Tom Copeland_, Jan 08 2016] [Broken link]
J. Taylor, Formal group laws and hypergraph colorings, doctoral thesis, Univ. of Wash., 2016, p. 96. [_Tom Copeland_, Dec 20 2018]
Jian Zhou, On Some Mathematics Related to the Interpolating Statistics, arXiv:2108.10514 [math-ph], 2021.

Row sums: A111884. Unsigned row sums: A000262.
A002868 gives maximal element (in magnitude) in each row.
Cf. A130561 for a natural refinement.
Cf. A264428, A264429, A271703 (unsigned).
Cf. A008297, A089231, A105278 (variants).
Cf. A002378, A008277, A132792, A133314, A132792, A001263.

# The function BellMatrix is defined in A264428.
BellMatrix(n -> `if`(n::odd, -(n+1)!, (n+1)!), 9); # Peter Luschny, Jan 27 2016

a[0, 0] = 1; a[n_, m_] := ((-1)^(n-m))*(n!/m!)*Binomial[n-1, m-1]; Table[a[n, m], {n, 0, 10}, {m, 0, n}] // Flatten (* Jean-François Alcover, Jul 05 2013 *)
T[ n_, k_] := (-1)^n n! Coefficient[ LaguerreL[ n, -1, x], x, k]; (* Michael Somos, Dec 15 2014 *)
rows = 9;
t = Table[(-1)^(n+1) n!, {n, 1, rows}];
T[n_, k_] := BellY[n, k, t];
Table[T[n, k], {n, 0, rows}, {k, 0, n}]  // Flatten (* Jean-François Alcover, Jun 22 2018, after Peter Luschny *)

{T(n, k) = if( n<1 || k<1, n==0 && k==0, (-1)^n * n! * polcoeff( sum(k=1, n, binomial( n-1, k-1) * (-x)^k / k!), k))}; /* Michael Somos, Dec 15 2014 */

lah_number = lambda n, k: factorial(n-k)*binomial(n,n-k)*binomial(n-1,n-k)
A111596_row = lambda n: [(-1)^(n-k)*lah_number(n, k) for k in (0..n)]
for n in range(10): print(A111596_row(n)) # Peter Luschny, Oct 05 2014

# uses[inverse_bell_transform from A264429]
def A111596_matrix(dim):
    fact = [factorial(n) for n in (1..dim)]
    return inverse_bell_transform(dim, fact)
A111596_matrix(10) # Peter Luschny, Dec 20 2015

E.g.f. m-th column: ((x/(1+x))^m)/m!, m>=0.
E.g.f. for row polynomials p(n, x) is exp(x*y/(1+y)).
a(n, m) = ((-1)^(n-m))*|A008297(n, m)| = ((-1)^(n-m))*(n!/m!)*binomial(n-1, m-1), n>=m>=1; a(0, 0)=1; else 0.
a(n, m) = -(n-1+m)*a(n-1, m) + a(n-1, m-1), n>=m>=0, a(n, -1):=0, a(0, 0)=1; a(n, m)=0 if n|a(n,m)| = Sum_{k=m..n} |S1(n,k)|*S2(k,m), n>=0. S2(n,m):=A048993. S1(n,m):=A048994. - Wolfdieter Lang, May 04 2007
From Tom Copeland, Nov 21 2011: (Start)
For this Lah triangle, the n-th row polynomial is given umbrally by
  (-1)^n n! binomial(-Bell.(-x),n), where Bell_n(-x)= exp(x)(xd/dx)^n exp(-x), the n-th Bell / Touchard / exponential polynomial with neg. arg., (cf. A008277). E.g., 2! binomial(-Bell.(-x),2) = -Bell.(-x)*(-Bell.(-x)-1) = Bell_2(-x)+Bell_1(-x) = -2x+x^2.
A Dobinski relation is (-1)^n n! binomial(-Bell.(-x),n)= (-1)^n n! e^x Sum_{j>=0} (-1)^j binomial(-j,n)x^j/j!= n! e^x Sum_{j>=0} (-1)^j binomial(j-1+n,n)x^j/j!. See the Copeland link for the relation to inverse Mellin transform. (End)
The n-th row polynomial is (-1/x)^n e^x (x^2*D_x)^n e^(-x). - Tom Copeland, Oct 29 2012
Let f(.,x)^n = f(n,x) = x!/(x-n)!, the falling factorial,and r(.,x)^n = r(n,x) = (x-1+n)!/(x-1)!, the rising factorial, then the Lah polynomials, Lah(n,t)= n!*Sum{k=1..n} binomial(n-1,k-1)(-t)^k/k! (extra sign factor on odd rows), give the transform Lah(n,-f(.,x))= r(n,x), and Lah(n,r(.,x))= (-1)^n * f(n,x). - Tom Copeland, Oct 04 2014
|T(n,k)| = Sum_{j=0..2*(n-k)} A254881(n-k,j)*k^j/(n-k)!. Note that A254883 is constructed analogously from A254882. - Peter Luschny, Feb 10 2015
The T(n,k) are the inverse Bell transform of [1!,2!,3!,...] and |T(n,k)| are the Bell transform of [1!,2!,3!,...]. See A264428 for the definition of the Bell transform and A264429 for the definition of the inverse Bell transform. - Peter Luschny, Dec 20 2015
Dividing each n-th diagonal by n!, where the main diagonal is n=1, generates a shifted, signed Narayana matrix A001263. - Tom Copeland, Sep 23 2020

New name using a comment from Wolfdieter Lang by Peter Luschny, May 10 2021

A129256 Central coefficient of Product_{k=0..n} (1+k*x)^2.

Original entry on oeis.org

1, 2, 13, 144, 2273, 46710, 1184153, 35733376, 1251320145, 49893169050, 2232012515445, 110722046632560, 6032418472347265, 358103844593876654, 23007314730623658225, 1590611390957425536000, 117745011140615270168865

Offset: 0

Paul D. Hanna, Apr 06 2007

nonn

			This sequence equals the central terms of the triangle in which the g.f. of row n is (1+x)^2*(1+2x)^2*(1+3x)^2*...*(1+n*x)^2, as illustrated by:
  (1);
   1, (2),  1;
   1,  6, (13),  12,     4;
   1, 12,  58, (144),  193,    132,      36;
   1, 20, 170,  800, (2273),  3980,    4180,   2400,    576;
   1, 30, 395, 3000, 14523, (46710), 100805, 143700, 129076, 65760, 14400;
  ...

Vaclav Kotesovec, Table of n, a(n) for n = 0..354

Cf. A008275 (Stirling1 numbers), A187235, A238261, A246117, A254882, A350376.

Cf. A384012, A384031, A384017.

Flatten[{1,Table[Coefficient[Expand[Product[(1+k*x),{k,0,n}]^2],x^n],{n,1,20}]}] (* Vaclav Kotesovec, Feb 10 2015 *)

PARI
```
a(n)=polcoeff(prod(k=0,n,1+k*x)^2,n)
```

{a(n)=(-1)^n*sum(k=0,n,stirling(n+1,k+1,1)*stirling(n+1,n-k+1,1))} \\ Paul D. Hanna, Jul 16 2009

a(n) = (-1)^n*Sum_{k=0..n} Stirling1(n+1,k+1)*Stirling1(n+1,n-k+1). - Paul D. Hanna, Jul 16 2009

a(n) ~ c * d^n * (n-1)!, where d = A238261 = -(2*LambertW(-1,-exp(-1/2)/2))^2 / (1 + 2*LambertW(-1,-exp(-1/2)/2)) = 4.910814964568255..., c = (-LambertW(-1, -exp(-1/2)/2))^(3/2)/(sqrt(-1 - LambertW(-1, -exp(-1/2)/2))*Pi) = 0.851946112888790982829578047527831525434714038256... . - Vaclav Kotesovec, Feb 10 2015, updated May 14 2025

A254881 Triangle read by rows, T(n,k) = sum(j=0..k-1, S(n+1,j+1)*S(n,k-j)) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n.

Original entry on oeis.org

1, 0, 1, 1, 0, 2, 5, 4, 1, 0, 12, 40, 51, 31, 9, 1, 0, 144, 564, 904, 769, 376, 106, 16, 1, 0, 2880, 12576, 23300, 24080, 15345, 6273, 1650, 270, 25, 1, 0, 86400, 408960, 840216, 991276, 748530, 381065, 133848, 32523, 5370, 575, 36, 1, 0, 3628800, 18299520

Offset: 0

Peter Luschny, Feb 10 2015

These are also the coefficients of the polynomials interpolating the sequence k -> n!*((n+k)!/k!)*binomial(n+k-1,k-1) (for fixed n>=0). Divided by n! these polynomials generate the rows of Lah numbers L(n+k, k) = ((n+k)!/k!)* binomial(n+k-1,k-1).

			[1]
[0, 1, 1]
[0, 2, 5, 4, 1]
[0, 12, 40, 51, 31, 9, 1]
[0, 144, 564, 904, 769, 376, 106, 16, 1]
[0, 2880, 12576, 23300, 24080, 15345, 6273, 1650, 270, 25, 1]
For example in the case n=3 the polynomial (k^6+9*k^5+31*k^4+51*k^3+40*k^2+12*k)/3! generates the Lah numbers 0, 24, 240, 1200, 4200, 11760, 28224, ... (A253285).

Cf. A246117, A254882, A187235.

The sequences A000012, A002378, A083374, A253285 are the Lah number rows generated by the polynomials divided by n! for n=0, 1, 2, 3 respectivly.

# This is a special case of the recurrence given in A246117.
t := proc(n,k) option remember; if n=0 and k=0 then 1 elif
k <= 0 or k>n then 0 else iquo(n,2)*t(n-1,k)+t(n-1,k-1) fi end:
A254881 := (n,k) -> t(2*n,k):
seq(print(seq(A254881(n,k), k=0..2*n)), n=0..5);
# Illustrating the comment:
restart: with(PolynomialTools): with(CurveFitting): for N from 0 to 5 do
CoefficientList(PolynomialInterpolation([seq([k,N!*((N+k)!/k!)*binomial(N+k-1,k-1)], k=0..2*N)], n), n) od;

Flatten[{1,Table[Table[Sum[Abs[StirlingS1[n+1,j+1]] * Abs[StirlingS1[n,k-j]],{j,0,k-1}],{k,0,2*n}],{n,1,10}]}] (* Vaclav Kotesovec, Feb 10 2015 *)

def T(n,k):
    if n == 0: return 1
    return sum(stirling_number1(n+1,j+1)*stirling_number1(n,k-j) for j in range(k))
for n in range (6): [T(n,k) for k in (0..2*n)]

T(n, n) = A187235(n) for n>=1 (after the explicit formula of Vaclav Kotesovec).

Showing 1-4 of 4 results.

cp's OEIS Frontend

A254883 Triangle read by rows, T(n,k) = sum(j=0..2*(n-k), A254882(n-k,j)*k^j /(n-k)!), n>=0, 0<=k<=n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Sage

A111596 The matrix inverse of the unsigned Lah numbers A271703.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Sage

Formula

Extensions

A129256 Central coefficient of Product_{k=0..n} (1+k*x)^2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A254881 Triangle read by rows, T(n,k) = sum(j=0..k-1, S(n+1,j+1)*S(n,k-j)) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A254883 Triangle read by rows, T(n,k) = sum(j=0..2(n-k), A254882(n-k,j)k^j /(n-k)!), n>=0, 0<=k<=n.