A089276 -id:A089276 - cp's OEIS frontend

A078739 Triangle of generalized Stirling numbers S_{2,2}(n,k) read by rows (n>=1, 2<=k<=2n).

1, 2, 4, 1, 4, 32, 38, 12, 1, 8, 208, 652, 576, 188, 24, 1, 16, 1280, 9080, 16944, 12052, 3840, 580, 40, 1, 32, 7744, 116656, 412800, 540080, 322848, 98292, 16000, 1390, 60, 1, 64, 46592, 1446368, 9196992, 20447056, 20453376, 10564304, 3047520, 511392, 50400

Offset: 1

N. J. A. Sloane, Dec 21 2002

A generalization of the Stirling2 numbers S_{1,1} from A008277.
The g.f. for column k=2*K is (x^K)*pe(K,x)*d(k,x) and for k=2*K+1 it is (x^K)*po(K,x)*2*(K+1)*K*d(k,x), K>= 1, with d(k,x) := 1/product(1-p*(p-1)*x,p=2..k) and the row polynomials pe(n,x) := sum(A089275(n,m)*x^m,m=0..n-1) and po(n,x) := sum(A089276(n,m)*x^m,m=0..n-1). - Wolfdieter Lang, Nov 07 2003
The formula for the k-th column sequence is given in A089511.
Codara et al., show that T(n,k) gives the number of k-colorings of the graph nK_2 (the disjoint union of n copies of the complete graph K_2). An example is given below. - Peter Bala, Aug 15 2013

			From _Peter Bala_, Aug 15 2013: (Start)
The table begins
n\k | 2    3    4    5    6   7   8
= = = = = = = = = = = = = = = = = =
  1 | 1
  2 | 2    4    1
  3 | 4   32   38   12    1
  4 | 8  208  652  576  188  24   1
...
Graph coloring interpretation of T(2,3) = 4: The graph 2K_2 is 2 copies of K_2, the complete graph on 2 vertices:
o---o  o---o
a   b  c   d
The four 3-colorings of 2K_2 are ac|b|d, ad|b|c, bc|a|d and bd|a|c. (End)

P. Blasiak, K. A. Penson and A. I. Solomon, The Boson Normal Ordering Problem and Generalized Bell Numbers, arXiv:quant-ph/0212072, 2002.
P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, arXiv:quant-ph/0402027, 2004.
P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, Phys. Lett. A 309 (2003) 198-205.
Steve Butler, Fan Chung, Jay Cummings, R. L. Graham, Juggling card sequences, arXiv:1504.01426 [math.CO], 2015.
Leonard Carlitz, On Arrays of Numbers, Am. J. Math., 54,4 (1932) 739-752. [Eqs. (3) and (4) with lambda = 0, mu = 2, a_{n,k-1} = a(n, k).- _Wolfdieter Lang_, Jan 30 2020 ]
P. Codara, O. M. D’Antona, P. Hell, A simple combinatorial interpretation of certain generalized Bell and Stirling numbers arXiv:1308.1700v1 [cs.DM]
A. Dzhumadildaev and D. Yeliussizov, Path decompositions of digraphs and their applications to Weyl algebra, arXiv preprint arXiv:1408.6764v1, 2014. [Version 1 contained many references to the OEIS, which were removed in Version 2. - _N. J. A. Sloane_, Mar 28 2015]
Askar Dzhumadil'daev and Damir Yeliussizov, Walks, partitions, and normal ordering, Electronic Journal of Combinatorics, 22(4) (2015), #P4.10.
S.-M. Ma, T. Mansour, M. Schork. Normal ordering problem and the extensions of the Stirling grammar, arXiv preprint arXiv:1308.0169 [math.CO], 2013.
Toufik Mansour, Matthias Schork and Mark Shattuck, The Generalized Stirling and Bell Numbers Revisited, Journal of Integer Sequences, Vol. 15 (2012), #12.8.3.

Row sums give A020556. Triangle S_{1, 1} = A008277, S_{2, 1} = A008297 (ignoring signs), S_{3, 1} = A035342, S_{3, 2} = A078740, S_{3, 3} = A078741. A090214 (S_{4,4}).
The column sequences are A000079(n-1)(powers of 2), 4*A016129(n-2), A089271, 12*A089272, A089273, etc.
Main diagonal is A217900.
Cf. A071951 (Legendre-Stirling triangle).
Cf. A122193, A055203.

# Note that the function implements the full triangle because it can be
# much better reused and referenced in this form.
A078739 := proc(n,k) local r;
add((-1)^(n-r)*binomial(n,r)*combinat[stirling2](n+r,k),r=0..n) end:
# Displays the truncated triangle from the definition:
seq(print(seq(A078739(n,k),k=2..2*n)),n=1..6); # Peter Luschny, Mar 25 2011

t[n_, k_] := Sum[(-1)^(n-r)*Binomial[n, r]*StirlingS2[n+r, k], {r, 0, n}]; Table[t[n, k], {n, 1, 7}, {k, 2, 2*n}] // Flatten (* Jean-François Alcover, Apr 11 2013, after Peter Luschny *)

a(n, k) = sum(binomial(k-2+p, p)*A008279(2, p)*a(n-1, k-2+p), p=0..2) if 2 <= k <= 2*n for n>=1, a(1, 2)=1; else 0. Here A008279(2, p) gives the third row (k=2) of the augmented falling factorial triangle: [1, 2, 2] for p=0, 1, 2. From eq.(21) with r=2 of the Blasiak et al. paper.
a(n, k) = (((-1)^k)/k!)*sum(((-1)^p)*binomial(k, p)*A008279(p, 2)^n, p=2..k) for 2 <= k <= 2*n, n>=1. From eq.(19) with r=2 of the Blasiak et al. paper.
a(n, k) = sum(A071951(n, j)*A089503(j, 2*j-k+1), j=ceiling(k/2)..min(n, k-1)), 1<=n, 2<=k<=2n; relation to Legendre-Stirling triangle. Wolfdieter Lang, Dec 01 2003
a(n, k) = A122193(n,k)*2^n/k! - Peter Luschny, Mar 25 2011
E^n = sum_{k=2}^(2n) a(n,k)*x^k*D^k where D is the operator d/dx, and E the operator x^2d^2/dx^2.
The row polynomials R(n,x) are given by the Dobinski-type formula R(n,x) = exp(-x)*sum {k = 0..inf} (k*(k-1))^n*x^k/k!. - Peter Bala, Aug 15 2013

More terms from Wolfdieter Lang, Nov 07 2003

A089275 Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.

Original entry on oeis.org

1, 1, 18, 1, 118, 600, 1, 412, 11772, 35280, 1, 1060, 97308, 1494576, 3265920, 1, 2270, 508708, 23753736, 249815520, 439084800, 1, 4298, 1989148, 218417400, 6710001408, 54187574400, 80951270400, 1, 7448, 6355048, 1402502400

Offset: 1

Wolfdieter Lang, Nov 07 2003

The polynomials are pe(n,x) := sum(a(n,m)*x^m,m=0..n-1). Companion polynomials are po(n,x) := sum(b(n,m)*x^m,m=0..n-1) with b(n,m) := A089276(n,m).

Wolfdieter Lang, First 7 rows, also for A089276

Cf. A078739, A089276.

Combined recursion for polynomials pe(n, x) and po(n, x) defined above: pe(n, x)= 4*(2*n-1)*n*(n-1)*x*po(n-1, x) + (1-(2*n-1)*(2*n-2)*x)*pe(n-1, x) and po(n, x) = 2*(pe(n, x) + ((n-1)/2)*(1-2*n*(2*n-1)*x)*po(n-1, x))/(n+1), n >= 2,  with po(1, x) = 1 = pe(1,x). (Corrected Wolfdieter Lang, Apr 11 2013)
Rewritten recursion for polynomial po: po(n, x) = (2*(1 - 2*(2*n-1)*(n-1)*x)*pe(n-1, x) + (n-1)*(1 + 6*n*(2*n-1)*x)* po(n-1, x))/(n+1), with pe(n,x) from above. - Wolfdieter Lang, Apr 11 2013
Combined recursion with b(n, m) := A089276(n, m): a(n, m) = a(n-1, m) - 2*(2*n-1)*(n-1)*a(n-1, m-1) + 4*n*(2*n-1)*(n-1)*b(n-1, m-1) and b(n, m) = (-2*n*(2*n-1)*(n-1)*b(n-1, m-1) + (n-1)*b(n-1, m) + 2*a(n, m))/(n+1), with n >= m+1 >= 2 and a(1, 0)= 1 = b(1, 0), else 0.
Rewritten recursion for triangle b: b(n, m) = (6*n*(2*n-1)*(n-1)*b(n-1, m-1) + (n-1)*b(n-1, m) + 2*a(n-1, m) - 4*(2*n-1)*(n-1)*a(n-1, m-1))/(n+1), with a(n, m) from above. - Wolfdieter Lang, Apr 11 2013

A089272 Fourth column (k=5) of array A078739(n,k) ((2,2)- generalized Stirling2) divided by 12.

Original entry on oeis.org

1, 48, 1412, 34400, 766416, 16296448, 337709632, 6896540160, 139644851456, 2813500878848, 56517475402752, 1133320271749120, 22702062218039296, 454469171469877248, 9094518828981174272, 181952003020274401280

Offset: 0

Wolfdieter Lang, Nov 07 2003

The numerator of the g.f. is the n=2 row polynomial of the triangle A089276.

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, Phys. Lett. A 309 (2003), 198-205.

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, arXiv:quant-ph/0402027, 2004.
Index entries for linear recurrences with constant coefficients, signature (40, -508, 2304, -2880).

Cf. A071952, A089271, A089273, A071951 (Legendre-Stirling triangle).

LinearRecurrence[{40, -508, 2304, -2880}, {1, 48, 1412, 34400}, 16] (* Jean-François Alcover, Feb 28 2020 *) (* Jean-François Alcover, Feb 28 2020 *)

G.f. (1+8*x)/((1-2*1*x)*(1-3*2*x)*(1-4*3*x)*(1-5*4*x)).

a(n)= (3500*20^n - 3780*12^n + 945*6^n - 35*2^n)/630 = d(n) + 8*d(n-1), with d(n) := A071952(n+4)= (2500*20^n - 2268*12^n + 405*6^n - 7*2^n)/630, n>=1.

A089511 Triangle of integers used to compute column sequences of array A078739 ((2,2)-Stirling2).

Original entry on oeis.org

1, -1, 3, 1, -6, 6, -1, 27, -108, 100, 1, -36, 216, -400, 225, -1, 135, -2160, 10000, -16875, 9261, 1, -162, 3240, -20000, 50625, -55566, 21952, -1, 567, -27216, 350000, -1771875, 4084101, -4302592, 1679616, 1, -648, 36288, -560000, 3543750, -10890936, 17210368, -13436928

Offset: 2

Wolfdieter Lang, Dec 01 2003

The k-th column sequence (without leading zeros) of A078739 is for even k: sum(a(k,m)*((m+1)*m)^n,m=1..k-1)/D(k) and for odd k it is: ((k^2-1)/2)*sum(a(k,m)*((m+1)*m)^n,m=1..k-1)/D(k), where D(k) := A089512(k) and n>=0, k>=2.

			[1]; [ -1,3]; [1,-6,6]; [ -1,27,-108,100]; ...
a(2,1)=A089512(2)*A089275(1,0)*A089278(1,1)/A089500(1)=1*1*1/1=1;
a(3,2)=A089512(3)*A089276(1,0)*A089278(2,2)/A089500(2)=2*1*3/2=3.
a(4,3)=1*(1+18/(4*3))*24/10 =6; a(5,4)= 18*(1+8/(5*4))*2500/630=100.
k=2 column sequence of A078739 is (1*(2*1)^n)/1 = 2^n. k=3: 4*(-1*(2*1)^n + 3*(3*2)^n)/2 (see A016129).

W. Lang, First 10 rows.

a(n, m) triangle 2<=n, 1<= m <= (n-1), else 0, with a(2*k, m)= D(2*k)*sum(A089275(k, p)/((m+1)*m)^p, p=0..k-1)*A089278(2*k-1, m)/A089500(2*k-1) and a(2*k+1, m)= D(2*k+1)*sum(A089276(k, p)/((m+1)*m)^p, p=0..k-1)*A089278(2*k, m)/A089500(2*k), where D(n) := A089512(n).

cp's OEIS Frontend

A078739 Triangle of generalized Stirling numbers S_{2,2}(n,k) read by rows (n>=1, 2<=k<=2n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A089275 Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A089272 Fourth column (k=5) of array A078739(n,k) ((2,2)- generalized Stirling2) divided by 12.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A089511 Triangle of integers used to compute column sequences of array A078739 ((2,2)-Stirling2).

Views

Author

Keywords

Comments

Examples

Links

Formula