A145596 → x ↦ x+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(4\,n + 4\,n x^{2} + 9\,n^{2} + 8\,n^{2} x + n^{2} x^{2} + 6\,n^{3} + 2\,n^{3} x + n^{4}\right)\,P_{n}(x) = \left(12 + 6\,x + 8\,x^{2} + 2\,x^{3} + 38\,n + 29\,n x + 19\,n x^{2} + 5\,n x^{3} + 44\,n^{2} + 41\,n^{2} x + 17\,n^{2} x^{2} + 3\,n^{2} x^{3} + 22\,n^{3} + 21\,n^{3} x + 6\,n^{3} x^{2} + 4\,n^{4} + 3\,n^{4} x\right)\,P_{n-1}(x) + \left(-6\,x - 10\,x^{2} - 6\,x^{3} - 2\,x^{4} - 13\,n x - 21\,n x^{2} - 10\,n x^{3} - 2\,n x^{4} - 9\,n^{2} x - 13\,n^{2} x^{2} - 4\,n^{2} x^{3} - 2\,n^{3} x - 2\,n^{3} 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 | 6 | 2 | 8 | |||||||||||||
| 2 | 28 | 20 | 3 | 51 | ||||||||||||
| 3 | 120 | 136 | 44 | 4 | 304 | |||||||||||
| 4 | 495 | 780 | 405 | 80 | 5 | 1765 | ||||||||||
| 5 | 2002 | 4070 | 2970 | 950 | 130 | 6 | 10128 | |||||||||
| 6 | 8008 | 20020 | 19019 | 8624 | 1925 | 196 | 7 | 57799 | ||||||||
| 7 | 31824 | 94640 | 111384 | 66248 | 21112 | 3528 | 280 | 8 | 329024 | |||||||
| 8 | 125970 | 434928 | 612612 | 454272 | 191100 | 45864 | 6006 | 384 | 9 | 1871145 | ||||||
| 9 | 497420 | 1957380 | 3217080 | 2870280 | 1513680 | 482160 | 91140 | 9660 | 510 | 10 | 10639320 | |||||
| 10 | 1961256 | 8669320 | 16308270 | 17054400 | 10872180 | 4362336 | 1099560 | 168960 | 14850 | 660 | 11 | 60511803 | ||||
| 11 | 7726160 | 37917616 | 80411496 | 96613176 | 72481200 | 35302608 | 11255904 | 2315808 | 296208 | 22000 | 836 | 12 | 344343024 | |||
| 12 | 30421755 | 164180900 | 387756655 | 526924112 | 455746863 | 262168764 | 101846745 | 26604864 | 4572711 | 495924 | 31603 | 1040 | 13 | 1960751949 | ||
| 13 | 119759850 | 705068910 | 1836042390 | 2786473690 | 2733981250 | 1818863046 | 837254418 | 267369102 | 58540482 | 8558550 | 798798 | 44226 | 1274 | 14 | 11172756000 | |
| 14 | 471435600 | 3007302900 | 8562829275 | 14363840400 | 15780539775 | 11942030100 | 6375644275 | 2419651520 | 649593945 | 121341220 | 15310295 | 1244880 | 60515 | 1540 | 15 | 63710826255 |
Compute more
?
Technical details
- Node id
n-2d75fda34284dcb7· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-e6f22d789fa4c102
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: 6, 2; 2: 28, 20, 3; 3: 120, 136, 44, 4; 4: 495, 780, 405, 80, 5; 5: 2002, 4070, 2970, 950, 130, 6; 6: 8008, 20020, 19019, 8624, 1925, 196, 7; 7: 31824, 94640, 111384, 66248, 21112, 3528, 280, 8; 8: 125970, 434928, 612612, 454272, 191100, 45864, 6006, 384, 9; 9: 497420, 1957380, 3217080, 2870280, 1513680, 482160, 91140, 9660, 510, 10;
%F FormulaThe row polynomials satisfy (n^4+6*n^3+9*n^2+4*n+(2*n^3+8*n^2)*x+(n^2+4*n)*x^2)*P(n,x) = (4*n^4+22*n^3+44*n^2+38*n+12+(3*n^4+21*n^3+41*n^2+29*n+6)*x+(6*n^3+17*n^2+19*n+8)*x^2+(3*n^2+5*n+2)*x^3)*P(n-1,x) - ((2*n^3+9*n^2+13*n+6)*x+(2*n^3+13*n^2+21*n+10)*x^2+(4*n^2+10*n+6)*x^3+(2*n+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[((4*n^4 + 22*n^3 + 44*n^2 + 38*n + 12 + (3*n^4 + 21*n^3 + 41*n^2 + 29*n + 6)*x + (6*n^3 + 17*n^2 + 19*n + 8)*x^2 + (3*n^2 + 5*n + 2)*x^3)*P[n - 1, x] - ((2*n^3 + 9*n^2 + 13*n + 6)*x + (2*n^3 + 13*n^2 + 21*n + 10)*x^2 + (4*n^2 + 10*n + 6)*x^3 + (2*n + 2)*x^4)*D[P[n - 1, x], x])/(n^4 + 6*n^3 + 9*n^2 + 4*n + (2*n^3 + 8*n^2)*x + (n^2 + 4*n)*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] = ((4*n^4 + 22*n^3 + 44*n^2 + 38*n + 12 + (3*n^4 + 21*n^3 + 41*n^2 + 29*n + 6)*x + (6*n^3 + 17*n^2 + 19*n + 8)*x^2 + (3*n^2 + 5*n + 2)*x^3)*v[i - 1] - ((2*n^3 + 9*n^2 + 13*n + 6)*x + (2*n^3 + 13*n^2 + 21*n + 10)*x^2 + (4*n^2 + 10*n + 6)*x^3 + (2*n + 2)*x^4)*deriv(v[i - 1], x))/(n^4 + 6*n^3 + 9*n^2 + 4*n + (2*n^3 + 8*n^2)*x + (n^2 + 4*n)*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
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…?
-
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
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…?
- ↑ Geometric basis map (elementary) (above)
-
from
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
-
from
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n …?
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.