A114655 → x ↦ x+1 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + 2\,x + x^{2} + n + 2\,n x + n x^{2}\right)\,P_{n}(x) = \left(3 + 10\,x + 11\,x^{2} + 4\,x^{3} + 3\,n + 10\,n x + 11\,n x^{2} + 4\,n x^{3}\right)\,P_{n-1}(x) + \left(2 + 10\,x + 18\,x^{2} + 14\,x^{3} + 4\,x^{4}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 2 | 2 | |||||||
| 2 | 6 | 8 | 14 | ||||||
| 3 | 22 | 60 | 40 | 122 | |||||
| 4 | 90 | 372 | 504 | 224 | 1190 | ||||
| 5 | 394 | 2184 | 4480 | 4032 | 1344 | 12434 | |||
| 6 | 1806 | 12560 | 34560 | 47040 | 31680 | 8448 | 136094 | ||
| 7 | 8558 | 71604 | 247320 | 451440 | 459360 | 247104 | 54912 | 1540298 | |
| 8 | 41586 | 406700 | 1690920 | 3874640 | 5285280 | 4292288 | 1921920 | 366080 | 17879414 |
Compute more
?
Technical details
- Node id
n-c797a96ea6c06aee· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-9a4b425d2a954ae8
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 -1)
- 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 ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 2; 2: 6, 8; 3: 22, 60, 40; 4: 90, 372, 504, 224; 5: 394, 2184, 4480, 4032, 1344; 6: 1806, 12560, 34560, 47040, 31680, 8448; 7: 8558, 71604, 247320, 451440, 459360, 247104, 54912; 8: 41586, 406700, 1690920, 3874640, 5285280, 4292288, 1921920, 366080; 9: 206098, 2306832, 11216128, 30942912, 52980928, 57657600, 38950912, 14936064, 2489344; 10: 1037718, 13081752, 72828288, 235015872, 484481088, 661699584, 598800384, 346245120, 116093952, 17199104;
%F FormulaThe row polynomials satisfy (n+1+(2*n+2)*x+(n+1)*x^2)*P(n,x) = (3*n+3+(10*n+10)*x+(11*n+11)*x^2+(4*n+4)*x^3)*P(n-1,x) + (2+10*x+18*x^2+14*x^3+4*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.
%t MathematicaP[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((3*n + 3 + (10*n + 10)*x + (11*n + 11)*x^2 + (4*n + 4)*x^3)*P[n - 1, x] + (2 + 10*x + 18*x^2 + 14*x^3 + 4*x^4)*D[P[n - 1, x], x])/(n + 1 + (2*n + 2)*x + (n + 1)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = ((3*n + 3 + (10*n + 10)*x + (11*n + 11)*x^2 + (4*n + 4)*x^3)*v[i - 1] + (2 + 10*x + 18*x^2 + 14*x^3 + 4*x^4)*deriv(v[i - 1], x))/(n + 1 + (2*n + 2)*x + (n + 1)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascen…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
-
-
from
shift_x_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascen…?
Related ?
Same fingerprint ?
- A063007 → basis A013609 → D
- A033282 → basis A013609
- A033282 → basis A013609 → reverse
- A114656 → basis A007318 → x ↦ x/(x+1)
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.