A124932 → reverse → (θ+1)²
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) = 1\)
\(P_{1}(x) = 3 + 8\,x\)
\(P_{2}(x) = 6 + 36\,x + 27\,x^{2}\)
\(P_{3}(x) = 10 + 96\,x + 162\,x^{2} + 64\,x^{3}\)
\(P_{4}(x) = 15 + 200\,x + 540\,x^{2} + 480\,x^{3} + 125\,x^{4}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 3 | 8 | 11 | |||||||||||||
| 2 | 6 | 36 | 27 | 69 | ||||||||||||
| 3 | 10 | 96 | 162 | 64 | 332 | |||||||||||
| 4 | 15 | 200 | 540 | 480 | 125 | 1360 | ||||||||||
| 5 | 21 | 360 | 1350 | 1920 | 1125 | 216 | 4992 | |||||||||
| 6 | 28 | 588 | 2835 | 5600 | 5250 | 2268 | 343 | 16912 | ||||||||
| 7 | 36 | 896 | 5292 | 13440 | 17500 | 12096 | 4116 | 512 | 53888 | |||||||
| 8 | 45 | 1296 | 9072 | 28224 | 47250 | 45360 | 24696 | 6912 | 729 | 163584 | ||||||
| 9 | 55 | 1800 | 14580 | 53760 | 110250 | 136080 | 102900 | 46080 | 10935 | 1000 | 477440 | |||||
| 10 | 66 | 2420 | 22275 | 95040 | 231000 | 349272 | 339570 | 211200 | 80190 | 16500 | 1331 | 1348864 | ||||
| 11 | 78 | 3168 | 32670 | 158400 | 445500 | 798336 | 950796 | 760320 | 400950 | 132000 | 23958 | 1728 | 3707904 | |||
| 12 | 91 | 4056 | 46332 | 251680 | 804375 | 1667952 | 2354352 | 2306304 | 1563705 | 715000 | 207636 | 33696 | 2197 | 9957376 | ||
| 13 | 105 | 5096 | 63882 | 384384 | 1376375 | 3243240 | 5297292 | 6150144 | 5108103 | 3003000 | 1211210 | 314496 | 46137 | 2744 | 26206208 | |
| 14 | 120 | 6300 | 85995 | 567840 | 2252250 | 5945940 | 11036025 | 14826240 | 14594580 | 10510500 | 5450445 | 1965600 | 461370 | 61740 | 3375 | 67768320 |
Compute more
?
Technical details
- Node id
n-846aecace8de9c1d· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-35caaae7884ed898
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: 3, 8; 2: 6, 36, 27; 3: 10, 96, 162, 64; 4: 15, 200, 540, 480, 125; 5: 21, 360, 1350, 1920, 1125, 216; 6: 28, 588, 2835, 5600, 5250, 2268, 343; 7: 36, 896, 5292, 13440, 17500, 12096, 4116, 512; 8: 45, 1296, 9072, 28224, 47250, 45360, 24696, 6912, 729; 9: 55, 1800, 14580, 53760, 110250, 136080, 102900, 46080, 10935, 1000;
%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) = 1, P(1,x) = 3 + 8*x, P(2,x) = 6 + 36*x + 27*x^2, P(3,x) = 10 + 96*x + 162*x^2 + 64*x^3, P(4,x) = 15 + 200*x + 540*x^2 + 480*x^3 + 125*x^4.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 8*x;
P[2, x_] := 6 + 36*x + 27*x^2;
P[3, x_] := 10 + 96*x + 162*x^2 + 64*x^3;
P[4, x_] := 15 + 200*x + 540*x^2 + 480*x^3 + 125*x^4;
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] = 1; v[2] = 3 + 8*x; v[3] = 6 + 36*x + 27*x^2; v[4] = 10 + 96*x + 162*x^2 + 64*x^3; v[5] = 15 + 200*x + 540*x^2 + 480*x^3 + 125*x^4; 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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= 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?
-
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*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
-
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = k*(k+1)*binomial(n,k)/2 (1 <= 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.