A093375 → D → D
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(6 - 5\,n + n^{2}\right)\,P_{n}(x) = \left(n + 2\,n x + n x^{2} - n^{2} - 2\,n^{2} x - n^{2} x^{2}\right)\,P_{n-2}(x) + \left(-6\,n - 6\,n x + 2\,n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 2\)
\(P_{3}(x) = 12 + 6\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||||||||
| 1 | 0 | |||||||||||||
| 2 | 2 | 2 | ||||||||||||
| 3 | 12 | 6 | 18 | |||||||||||
| 4 | 36 | 48 | 12 | 96 | ||||||||||
| 5 | 80 | 180 | 120 | 20 | 400 | |||||||||
| 6 | 150 | 480 | 540 | 240 | 30 | 1440 | ||||||||
| 7 | 252 | 1050 | 1680 | 1260 | 420 | 42 | 4704 | |||||||
| 8 | 392 | 2016 | 4200 | 4480 | 2520 | 672 | 56 | 14336 | ||||||
| 9 | 576 | 3528 | 9072 | 12600 | 10080 | 4536 | 1008 | 72 | 41472 | |||||
| 10 | 810 | 5760 | 17640 | 30240 | 31500 | 20160 | 7560 | 1440 | 90 | 115200 | ||||
| 11 | 1100 | 8910 | 31680 | 64680 | 83160 | 69300 | 36960 | 11880 | 1980 | 110 | 309760 | |||
| 12 | 1452 | 13200 | 53460 | 126720 | 194040 | 199584 | 138600 | 63360 | 17820 | 2640 | 132 | 811008 | ||
| 13 | 1872 | 18876 | 85800 | 231660 | 411840 | 504504 | 432432 | 257400 | 102960 | 25740 | 3432 | 156 | 2076672 | |
| 14 | 2366 | 26208 | 132132 | 400400 | 810810 | 1153152 | 1177176 | 864864 | 450450 | 160160 | 36036 | 4368 | 182 | 5218304 |
Compute more
?
Other recurrences
Derivative · proved equal for all n (proof step)
\(\left(4 - 2\,x - 4\,n + n x + n^{2}\right)\,P_{n}(x) = \left(-n + n x^{2} + n^{2} + n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 2\)
Technical details
- Node id
n-1cd5d4ff73ee9007· revision 0 · JSON- Definition source
derived:one_plus_derivativederived:derivative(equal bye-d1595534f9f3ca9c)- Fingerprint
f6-e99c3824c4864868
Observed on the stored rows ?
- Degrees: -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 (affine: slope 1, intercept -2)
- 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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 0; 2: 2; 3: 12, 6; 4: 36, 48, 12; 5: 80, 180, 120, 20; 6: 150, 480, 540, 240, 30; 7: 252, 1050, 1680, 1260, 420, 42; 8: 392, 2016, 4200, 4480, 2520, 672, 56; 9: 576, 3528, 9072, 12600, 10080, 4536, 1008, 72;
%F FormulaThe row polynomials satisfy (n^2-5*n+6)*P(n,x) = -(n^2-n+(2*n^2-2*n)*x+(n^2-n)*x^2)*P(n-2,x) + (2*n^2-6*n+(2*n^2-6*n)*x)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 2, P(3,x) = 12 + 6*x.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 2;
P[3, x_] := 12 + 6*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - n + (2*n^2 - 2*n)*x + (n^2 - n)*x^2)*P[n - 2, x] + (2*n^2 - 6*n + (2*n^2 - 6*n)*x)*P[n - 1, x])/(n^2 - 5*n + 6)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 2; v[4] = 12 + 6*x; for(n = 4, N, my(i = n + 1); v[i] = (-(n^2 - n + (2*n^2 - 2*n)*x + (n^2 - n)*x^2)*v[i - 2] + (2*n^2 - 6*n + (2*n^2 - 6*n)*x)*v[i - 1])/(n^2 - 5*n + 6)); 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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
one_plus_derivative of Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
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
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
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
-
from
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
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
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
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
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Exponential Riordan array [x*exp(x),x].?
-
Geometric basis map (elementary) polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
-
from
Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
one_plus_derivative of Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
derivative of Exponential Riordan array [x*exp(x),x].?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
derivative of Exponential Riordan array [x*exp(x),x].?
Related ?
Same fingerprint ?
- A027465 → basis A013611 → D+1
- A028326 → basis A013609 → D+1
- A007318 → ×(−(1/2)n+(1/2)n²) → D+1
- A085881 → θ+1
- A178821 → basis A013609 → D+1
- A156992 → D+1
- A038338 → θ+1
- basis-map coefficients of A113214, shifted → D+1
- A085881 → basis A013609 → D+1
- basis-map coefficients of A026729, shifted → basis A007318 → D+1
- A196347 → basis A013609 → D+1
- A028326 → D → θ+1
- A085880 → basis A013609 → θ+1
- A038221 → basis A013609 → θ+1
- A085880 → θ+1
- A124860 → θ+1
- A134346 → θ+1
- A093375: Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
- A085881 → basis A013609 → θ+1
- A178821 → θ+1
- A038338 → basis A013609 → D+1
- A156992 → basis A013609 → θ+1
- A120910 → basis A013610 → θ+1
- A038325 → basis A013609 → D+1
- A178820 → basis A013609 → θ+1
- A038221 → θ+1
- A038338 → basis A013609 → θ+1
- A376827 → θ+1
- A344565 → D+1
- A156992 → basis A013609 → D+1
- basis-map coefficients of A113214, shifted → D → D+1
- A178822 → D+1
- basis-map coefficients of A113214, shifted → basis A013609 → D+1
- A028326 → basis A013609 → θ+1
- basis-map coefficients of A026729 → basis A007318 → D+1
- basis-map coefficients of A112227 → x ↦ x+1 → D+1
- A028326 → D → D+1
- A085880 → basis A013609 → D+1
- A085880 → D → θ+1
- A134346 → D+1
- A094305 → D+1
- A356546 → D+1
- A135065 → θ+1
- basis-map coefficients of A112227 → x ↦ x+1 → θ+1
- A356546 → θ+1
- A038208 → D+1
- A178820 → D+1
- A003506 → D → θ+1
- A156992 → θ+1
- A038325 → D+1
- A344565 → θ+1
- A038221 → basis A013609 → D+1
- A038325 → basis A013609 → θ+1
- A131431 → x ↦ x+1 → D+1
- basis-map coefficients of A127647 → θ+1
- A178822 → basis A013609 → θ+1
- basis-map coefficients of A113214, shifted → D → θ+1
- A356546 → basis A013609 → D+1
- A038221 → D+1
- A103406: Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix w…
- A196347 → D+1
- A038330 → basis A013611 → θ+1
- A038330 → basis A013611 → D+1
- basis-map coefficients of A113214, shifted → basis A013609 → θ+1
- A120910 → basis A013610 → D+1
- A178821 → D+1
- basis-map coefficients of A127647 → D+1
- A007318 → ×(−(1/2)n+(1/2)n²) → θ+1
- A131431 → D+1 → basis A007318
- A131431 → x ↦ x+1 → θ+1
- A028326 → θ+1
- A178822 → basis A013609 → D+1
- A124860 → D+1
- A178822 → θ+1
- A135838 → θ+1
- A085880 → D → D+1
- A093375 → D
- A178820 → θ+1
- A027465 → basis A013611 → θ+1
- A038208 → D → θ+1
- A135838 → D+1
- A356546 → basis A013609 → θ+1
- A085881 → D+1
- A135065 → D+1
- basis-map coefficients of A026729 → basis A007318 → θ+1
- A038338 → D+1
- A085880 → D+1
- A094305 → θ+1
- A376827 → D+1
- A028326 → D+1
- A216973 → θ+1
- A196347 → θ+1
- A038208 → θ+1
- A178821 → basis A013609 → θ+1
- basis-map coefficients of A113214, shifted → θ+1
- A038208 → D → D+1
- basis-map coefficients of A026729, shifted → basis A007318 → θ+1
- A178820 → basis A013609 → D+1
- A038325 → θ+1
- A196347 → basis A013609 → θ+1
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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.