A125092 → D+1 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 + 5\,x + 10\,x^{2} + 10\,x^{3} + 5\,x^{4} + x^{5}\right)\,P_{n-5}(x) + \left(-5 - 20\,x - 30\,x^{2} - 20\,x^{3} - 5\,x^{4}\right)\,P_{n-4}(x) + \left(10 + 30\,x + 30\,x^{2} + 10\,x^{3}\right)\,P_{n-3}(x) + \left(-10 - 20\,x - 10\,x^{2}\right)\,P_{n-2}(x) + \left(5 + 5\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 4\)
\(P_{2}(x) = 26 + 18\,x\)
\(P_{3}(x) = 66 + 150\,x + 48\,x^{2}\)
\(P_{4}(x) = 124 + 492\,x + 492\,x^{2} + 100\,x^{3}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 4 | 4 | |||||||||||||
| 2 | 26 | 18 | 44 | ||||||||||||
| 3 | 66 | 150 | 48 | 264 | |||||||||||
| 4 | 124 | 492 | 492 | 100 | 1208 | ||||||||||
| 5 | 200 | 1140 | 1980 | 1220 | 180 | 4720 | |||||||||
| 6 | 294 | 2190 | 5460 | 5820 | 2550 | 294 | 16608 | ||||||||
| 7 | 406 | 3738 | 12180 | 18620 | 14070 | 4746 | 448 | 54208 | |||||||
| 8 | 536 | 5880 | 23688 | 47320 | 51240 | 29736 | 8120 | 648 | 167168 | ||||||
| 9 | 684 | 8712 | 41832 | 103320 | 146160 | 121464 | 56952 | 13032 | 900 | 493056 | |||||
| 10 | 850 | 12330 | 68760 | 202440 | 354060 | 384300 | 257880 | 101160 | 19890 | 1210 | 1402880 | ||||
| 11 | 1034 | 16830 | 106920 | 365640 | 762300 | 1022868 | 896280 | 502920 | 169290 | 29150 | 1584 | 3874816 | |||
| 12 | 1236 | 22308 | 159060 | 619740 | 1500840 | 2400552 | 2600136 | 1904760 | 916740 | 269940 | 41316 | 2028 | 10438656 | ||
| 13 | 1456 | 28860 | 228228 | 998140 | 2754180 | 5117112 | 6606600 | 5981976 | 3758040 | 1581580 | 413556 | 56940 | 2548 | 27529216 | |
| 14 | 1694 | 36582 | 317772 | 1541540 | 4774770 | 10108098 | 15159144 | 16360344 | 12702690 | 6976970 | 2606604 | 612612 | 76622 | 3150 | 71278592 |
Compute more
?
Technical details
- Node id
n-c39c39858bd879ae· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-247274a7023599a1
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 4; 2: 26, 18; 3: 66, 150, 48; 4: 124, 492, 492, 100; 5: 200, 1140, 1980, 1220, 180; 6: 294, 2190, 5460, 5820, 2550, 294; 7: 406, 3738, 12180, 18620, 14070, 4746, 448; 8: 536, 5880, 23688, 47320, 51240, 29736, 8120, 648; 9: 684, 8712, 41832, 103320, 146160, 121464, 56952, 13032, 900;
%F FormulaThe row polynomials satisfy P(n,x) = (1+5*x+10*x^2+10*x^3+5*x^4+x^5)*P(n-5,x) - (5+20*x+30*x^2+20*x^3+5*x^4)*P(n-4,x) + (10+30*x+30*x^2+10*x^3)*P(n-3,x) - (10+20*x+10*x^2)*P(n-2,x) + (5+5*x)*P(n-1,x) for n >= 5, with P(0,x) = 0, P(1,x) = 4, P(2,x) = 26 + 18*x, P(3,x) = 66 + 150*x + 48*x^2, P(4,x) = 124 + 492*x + 492*x^2 + 100*x^3.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 4;
P[2, x_] := 26 + 18*x;
P[3, x_] := 66 + 150*x + 48*x^2;
P[4, x_] := 124 + 492*x + 492*x^2 + 100*x^3;
P[n_, x_] := P[n, x] = Expand[(1 + 5*x + 10*x^2 + 10*x^3 + 5*x^4 + x^5)*P[n - 5, x] - (5 + 20*x + 30*x^2 + 20*x^3 + 5*x^4)*P[n - 4, x] + (10 + 30*x + 30*x^2 + 10*x^3)*P[n - 3, x] - (10 + 20*x + 10*x^2)*P[n - 2, x] + (5 + 5*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 4; v[3] = 26 + 18*x; v[4] = 66 + 150*x + 48*x^2; v[5] = 124 + 492*x + 492*x^2 + 100*x^3; for(n = 5, N, my(i = n + 1); v[i] = (1 + 5*x + 10*x^2 + 10*x^3 + 5*x^4 + x^5)*v[i - 5] - (5 + 20*x + 30*x^2 + 20*x^3 + 5*x^4)*v[i - 4] + (10 + 30*x + 30*x^2 + 10*x^3)*v[i - 3] - (10 + 20*x + 10*x^2)*v[i - 2] + (5 + 5*x)*v[i - 1]); 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
one_plus_derivative of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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 [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?
-
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)
-
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 (above)
-
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 [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 (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 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…?
-
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?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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) (above)
- ↑ 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…?
-
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: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
-
from
one_plus_derivative of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
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.