A253284: Triangle read by rows, T(n,k) = (k+1)*(n+1)!*(n+k)!/((k+1)!^2*(n-k)!) with n >= 0 and 0 <= k <= n.

A253284 ↗ nonnegative coefficients

Proved for all n all roots real, in (−∞, 0)coefficients of one signHadamard kernelinterlacing (weak)

Recurrence from A253284

\(P_{n}(x) = \left(-1 - 2\,x + 2\,n + 4\,n x\right)\,P_{n-1}(x) + \left(2\,n - n^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 2\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
26181236
324144240120528
4120120036004200168010800
572010800504001008009072030240283680
650401058407056002116800317520023284806652809102240
74032011289601016064042336000931392001117670406918912017297280345058560
836288013063680152409600838252800251475840043589145604358914560233513280051891840015090727680
93628800163296000239500800016765056000653837184001525620096002179457280001868106240008821612800017643225600747888422400
1039916800219542400039517632000342486144000167818210560050345463168009589612032000116445288960008733396672000368743415040067044257280041422381862400
1147900160031614105600684972288000719220902400043153254144000161105482137600391256170905600628804560384000663738147072000442492098048000168951528345600281585880576002535569103513600
1262270208004857076224001246649564160015583119552000011219846077440005086330221772800152589906653184003106294528296960043142979559680000402667809223680002416006855342080084194178292224001295295050649600169983582318950400
13871782912007933224499200237996734976000349061877964800029670259627008000160219401985843200579841645282099200144960411320524800025368071981091840003100542131022336000259318069140049920014144621953093632004533532677273600006476475253248000012386182292118835200
1413076743680001373058086400004759934699520000809188898918400008010970099292160005073614396218368000217440616980787200006523218509423616000013952439589600512000021393740704054118400023338626222604492800017680777441367040000088403887206835200000262297247756544000003497296636753920000974723523832041984000
Technical details
Node id
n-694017a14c5c1f2e · revision 1 · JSON
Definition source
oeis_catalog:A253284
Fingerprint
f6-3d0fbbfa79b3fd61

Observed on the stored rows ?

  • Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept 0)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

Matches ?

  • A253284 triangle 36 terms, 8 rows · tabl · nonn · catalog b-file?

Row sums ? A052716

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:       1;
  1:       2,         2;
  2:       6,        18,         12;
  3:      24,       144,        240,         120;
  4:     120,      1200,       3600,        4200,        1680;
  5:     720,     10800,      50400,      100800,       90720,        30240;
  6:    5040,    105840,     705600,     2116800,     3175200,      2328480,       665280;
  7:   40320,   1128960,   10160640,    42336000,    93139200,    111767040,     69189120,     17297280;
  8:  362880,  13063680,  152409600,   838252800,  2514758400,   4358914560,   4358914560,   2335132800,   518918400;
  9: 3628800, 163296000, 2395008000, 16765056000, 65383718400, 152562009600, 217945728000, 186810624000, 88216128000, 17643225600;
%F Formula
The row polynomials satisfy P(n,x) = (2*n-1+(4*n-2)*x)*P(n-1,x) - (n^2-2*n)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[(2*n - 1 + (4*n - 2)*x)*P[n - 1, x] - (n^2 - 2*n)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 1 + (4*n - 2)*x)*v[i - 1] - (n^2 - 2*n)*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

A253284 triangle, offset 0, from P0
%e Example
Triangle begins:
  0:       1;
  1:       2,         2;
  2:       6,        18,         12;
  3:      24,       144,        240,         120;
  4:     120,      1200,       3600,        4200,        1680;
  5:     720,     10800,      50400,      100800,       90720,        30240;
  6:    5040,    105840,     705600,     2116800,     3175200,      2328480,       665280;
  7:   40320,   1128960,   10160640,    42336000,    93139200,    111767040,     69189120,     17297280;
  8:  362880,  13063680,  152409600,   838252800,  2514758400,   4358914560,   4358914560,   2335132800,   518918400;
  9: 3628800, 163296000, 2395008000, 16765056000, 65383718400, 152562009600, 217945728000, 186810624000, 88216128000, 17643225600;
%F Formula
The row polynomials satisfy P(n,x) = (2*n-1+(4*n-2)*x)*P(n-1,x) - (n^2-2*n)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[(2*n - 1 + (4*n - 2)*x)*P[n - 1, x] - (n^2 - 2*n)*P[n - 2, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 1 + (4*n - 2)*x)*v[i - 1] - (n^2 - 2*n)*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.