A357367: Triangle read by rows. T(n, k) = binomial(n - 1, k - 1)*(n + k)! / k!.
A357367 ↗ nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence from A357367
\(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\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 0 | 2 | 2 | |||||||||||||
| 2 | 0 | 6 | 12 | 18 | ||||||||||||
| 3 | 0 | 24 | 120 | 120 | 264 | |||||||||||
| 4 | 0 | 120 | 1080 | 2520 | 1680 | 5400 | ||||||||||
| 5 | 0 | 720 | 10080 | 40320 | 60480 | 30240 | 141840 | |||||||||
| 6 | 0 | 5040 | 100800 | 604800 | 1512000 | 1663200 | 665280 | 4551120 | ||||||||
| 7 | 0 | 40320 | 1088640 | 9072000 | 33264000 | 59875200 | 51891840 | 17297280 | 172529280 | |||||||
| 8 | 0 | 362880 | 12700800 | 139708800 | 698544000 | 1816214400 | 2542700160 | 1816214400 | 518918400 | 7545363840 | ||||||
| 9 | 0 | 3628800 | 159667200 | 2235340800 | 14529715200 | 50854003200 | 101708006400 | 116237721600 | 70572902400 | 17643225600 | 373944211200 | |||||
| 10 | 0 | 39916800 | 2155507200 | 37362124800 | 305124019200 | 1373058086400 | 3661488230400 | 5928123801600 | 5716405094400 | 3016991577600 | 670442572800 | 20711190931200 | ||||
| 11 | 0 | 479001600 | 31135104000 | 653837184000 | 6538371840000 | 36614882304000 | 124490599833600 | 266765571072000 | 362038989312000 | 301699157760000 | 140792940288000 | 28158588057600 | 1267784551756800 | |||
| 12 | 0 | 6227020800 | 479480601600 | 11987015040000 | 143844180480000 | 978140427264000 | 4108189794508800 | 11150800870809600 | 19912144412160000 | 23230835147520000 | 17035945774848000 | 7124122778572800 | 1295295050649600 | 84991791159475200 | ||
| 13 | 0 | 87178291200 | 7846046208000 | 230150688768000 | 3260468090880000 | 26409791536128000 | 133809610449715200 | 446032034832384000 | 1003572078372864000 | 1533235119736320000 | 1567307011286016000 | 1025873680114483200 | 388588515194880000 | 64764752532480000 | 6193091146059417600 | |
| 14 | 0 | 1307674368000 | 135998134272000 | 4623936565248000 | 76294953326592000 | 724802056602624000 | 4348812339615744000 | 17395249358462976000 | 47836935735773184000 | 91687460160231936000 | 122249946880309248000 | 111136315345735680000 | 65671459067934720000 | 22732428138900480000 | 3497296636753920000 | 487361761916020992000 |
b-files: A032037 (row sums), A357367 ?
Compute more
?
Technical details
- Node id
n-4cba07695b3e3f90· revision 1 · JSON- Definition source
oeis_catalog:A357367- Fingerprint
f6-1e5fbd8fe1b88630
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 ?
Row sums ? A032037
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 0, 2; 2: 0, 6, 12; 3: 0, 24, 120, 120; 4: 0, 120, 1080, 2520, 1680; 5: 0, 720, 10080, 40320, 60480, 30240; 6: 0, 5040, 100800, 604800, 1512000, 1663200, 665280; 7: 0, 40320, 1088640, 9072000, 33264000, 59875200, 51891840, 17297280; 8: 0, 362880, 12700800, 139708800, 698544000, 1816214400, 2542700160, 1816214400, 518918400; 9: 0, 3628800, 159667200, 2235340800, 14529715200, 50854003200, 101708006400, 116237721600, 70572902400, 17643225600;
%F FormulaThe 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*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 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/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[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
A357367 triangle, offset 0, from P0
%e ExampleTriangle begins: 0: 1; 1: 0, 2; 2: 0, 6, 12; 3: 0, 24, 120, 120; 4: 0, 120, 1080, 2520, 1680; 5: 0, 720, 10080, 40320, 60480, 30240; 6: 0, 5040, 100800, 604800, 1512000, 1663200, 665280; 7: 0, 40320, 1088640, 9072000, 33264000, 59875200, 51891840, 17297280; 8: 0, 362880, 12700800, 139708800, 698544000, 1816214400, 2542700160, 1816214400, 518918400; 9: 0, 3628800, 159667200, 2235340800, 14529715200, 50854003200, 101708006400, 116237721600, 70572902400, 17643225600;
%F FormulaThe 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*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 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/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[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
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m ≥ 1
Proof chains ? JSON
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
Related ?
Same fingerprint ?
- A126216: Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but …
- A033282: Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
- A132812 → x ↦ x+1
- A132812 → x ↦ x/(x+1)
- narayana → x ↦ x/(x+1)
- A063007 → D
- narayana → basis A007318
- A386789: Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*binomial(n + k, k).
References
- [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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.