A033282 → x ↦ x+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(4 + 2\,x - 2\,x^{2} + 4\,n + n x - n x^{2} + 3\,n^{2} + n^{3}\right)\,P_{n}(x) = \left(16 + 10\,x - 6\,x^{2} - 4\,x^{3} + 26\,n + 17\,n x - 3\,n x^{2} - 2\,n x^{3} + 15\,n^{2} + 10\,n^{2} x + 3\,n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(4 + 2\,x - 8\,x^{2} - 8\,x^{3} - 2\,x^{4} + 8\,n + 12\,n x + 4\,n x^{2} + 4\,n^{2} + 6\,n^{2} x + 2\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 5 | 2 | 7 | |||||||||||||
| 2 | 26 | 25 | 5 | 56 | ||||||||||||
| 3 | 138 | 219 | 105 | 14 | 476 | |||||||||||
| 4 | 743 | 1666 | 1316 | 420 | 42 | 4187 | ||||||||||
| 5 | 4043 | 11780 | 13140 | 6900 | 1650 | 132 | 37645 | |||||||||
| 6 | 22180 | 79731 | 115560 | 85635 | 33660 | 6435 | 429 | 343630 | ||||||||
| 7 | 122468 | 524405 | 937860 | 902825 | 500500 | 157157 | 25025 | 1430 | 3171670 | |||||||
| 8 | 679757 | 3380740 | 7203812 | 8556548 | 6160154 | 2726724 | 712712 | 97240 | 4862 | 29522549 | ||||||
| 9 | 3789297 | 21477510 | 53169012 | 75248628 | 66835314 | 38407824 | 14145768 | 3166488 | 377910 | 16796 | 276634547 | |||||
| 10 | 21199998 | 134930445 | 380768115 | 626139150 | 662625600 | 469706328 | 224531580 | 70795140 | 13856700 | 1469650 | 58786 | 2606081492 | ||||
| 11 | 118973550 | 840313551 | 2663445015 | 4993282140 | 6139943040 | 5185367880 | 3057043836 | 1250727060 | 344712060 | 59939110 | 5720330 | 208012 | 24659675584 | |||
| 12 | 669447123 | 5196728070 | 18282880440 | 38503337400 | 53980037100 | 52968749328 | 37201189080 | 18767940840 | 6710373450 | 1642551900 | 256924536 | 22287000 | 742900 | 234203189167 | ||
| 13 | 3775577367 | 31954358280 | 123581995992 | 288922230168 | 455050148124 | 509105134824 | 415427191608 | 249645632808 | 110048525730 | 34938468136 | 7691392280 | 1093251640 | 86919300 | 2674440 | 2231323500697 | |
| 14 | 21336790152 | 195551403495 | 824706359022 | 2119793796393 | 3706635656724 | 4658926971699 | 4334391833772 | 3026079494295 | 1588778182992 | 621797010835 | 177507560230 | 35502188085 | 4624106760 | 339319575 | 9694845 | 21315980368874 |
Compute more
?
Technical details
- Node id
n-22512e1f0b3f785c· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-fc86a5a5e40346c1
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 ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 5, 2; 2: 26, 25, 5; 3: 138, 219, 105, 14; 4: 743, 1666, 1316, 420, 42; 5: 4043, 11780, 13140, 6900, 1650, 132; 6: 22180, 79731, 115560, 85635, 33660, 6435, 429; 7: 122468, 524405, 937860, 902825, 500500, 157157, 25025, 1430; 8: 679757, 3380740, 7203812, 8556548, 6160154, 2726724, 712712, 97240, 4862; 9: 3789297, 21477510, 53169012, 75248628, 66835314, 38407824, 14145768, 3166488, 377910, 16796;
%F FormulaThe row polynomials satisfy (n^3+3*n^2+4*n+4+(n+2)*x-(n+2)*x^2)*P(n,x) = (3*n^3+15*n^2+26*n+16+(2*n^3+10*n^2+17*n+10)*x-(3*n+6)*x^2-(2*n+4)*x^3)*P(n-1,x) + (4*n^2+8*n+4+(6*n^2+12*n+2)*x+(2*n^2+4*n-8)*x^2-8*x^3-2*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((3*n^3 + 15*n^2 + 26*n + 16 + (2*n^3 + 10*n^2 + 17*n + 10)*x - (3*n + 6)*x^2 - (2*n + 4)*x^3)*P[n - 1, x] + (4*n^2 + 8*n + 4 + (6*n^2 + 12*n + 2)*x + (2*n^2 + 4*n - 8)*x^2 - 8*x^3 - 2*x^4)*D[P[n - 1, x], x])/(n^3 + 3*n^2 + 4*n + 4 + (n + 2)*x - (n + 2)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((3*n^3 + 15*n^2 + 26*n + 16 + (2*n^3 + 10*n^2 + 17*n + 10)*x - (3*n + 6)*x^2 - (2*n + 4)*x^3)*v[i - 1] + (4*n^2 + 8*n + 4 + (6*n^2 + 12*n + 2)*x + (2*n^2 + 4*n - 8)*x^2 - 8*x^3 - 2*x^4)*deriv(v[i - 1], x))/(n^3 + 3*n^2 + 4*n + 4 + (n + 2)*x - (n + 2)*x^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
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
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 re…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
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 of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
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
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
-
from
basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 re…?
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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023