A104684 → basis A007318 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-16 + 42\,x - 45\,x^{2} + 12\,x^{3} - x^{4} + 16\,n - 82\,n x + 125\,n x^{2} - 50\,n x^{3} + 5\,n x^{4} + 40\,n^{2} x - 116\,n^{2} x^{2} + 76\,n^{2} x^{3} - 10\,n^{2} x^{4} + 36\,n^{3} x^{2} - 50\,n^{3} x^{3} + 10\,n^{3} x^{4} + 12\,n^{4} x^{3} - 5\,n^{4} x^{4} + n^{5} x^{4}\right)\,P_{n}(x) = \left(-176 + 366\,x + 105\,x^{2} - 56\,x^{3} + x^{4} + 112\,n - 766\,n x + 323\,n x^{2} + 278\,n x^{3} - 45\,n x^{4} - 4\,n x^{5} + 336\,n^{2} x - 728\,n^{2} x^{2} - 138\,n^{2} x^{3} + 149\,n^{2} x^{4} + 5\,n^{2} x^{5} + 300\,n^{3} x^{2} - 160\,n^{3} x^{3} - 129\,n^{3} x^{4} + 5\,n^{3} x^{5} + 92\,n^{4} x^{3} + 21\,n^{4} x^{4} - 9\,n^{4} x^{5} + 7\,n^{5} x^{4} + 3\,n^{5} x^{5}\right)\,P_{n-1}(x) + \left(-16 + 72\,x + 96\,x^{2} - 12\,x^{3} - 20\,x^{4} - 96\,n x + 28\,n x^{2} + 182\,n x^{3} + 40\,n x^{4} - 20\,n x^{5} - 2\,n x^{6} - 120\,n^{2} x^{2} - 100\,n^{2} x^{3} + 64\,n^{2} x^{4} + 46\,n^{2} x^{5} + 2\,n^{2} x^{6} - 48\,n^{3} x^{3} - 68\,n^{3} x^{4} - 18\,n^{3} x^{5} + 2\,n^{3} x^{6} - 4\,n^{4} x^{4} - 6\,n^{4} x^{5} - 2\,n^{4} x^{6}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 3 | 4 | 7 | |||||||||||||
| 3 | 13 | 32 | 9 | 54 | ||||||||||||
| 4 | 63 | 228 | 135 | 16 | 442 | |||||||||||
| 5 | 321 | 1536 | 1404 | 384 | 25 | 3670 | ||||||||||
| 6 | 1683 | 10020 | 12420 | 5440 | 875 | 36 | 30474 | |||||||||
| 7 | 8989 | 64032 | 100305 | 60800 | 16125 | 1728 | 49 | 252028 | ||||||||
| 8 | 48639 | 403396 | 764127 | 593040 | 221375 | 40068 | 3087 | 64 | 2073796 | |||||||
| 9 | 265729 | 2514944 | 5589360 | 5293568 | 2558500 | 661248 | 87808 | 5120 | 81 | 16976358 | ||||||
| 10 | 1462563 | 15554628 | 39679632 | 44389632 | 26390700 | 8917776 | 1712256 | 175104 | 8019 | 100 | 138290410 | |||||
| 11 | 8097453 | 95600160 | 275301585 | 355345920 | 251044500 | 105090048 | 26609940 | 3978240 | 324405 | 12000 | 121 | 1121404372 | ||||
| 12 | 45046719 | 584585892 | 1875702015 | 2744346000 | 2247481500 | 1124023824 | 354828012 | 70498560 | 8486775 | 566500 | 17303 | 144 | 9055583244 | |||
| 13 | 251595969 | 3559712256 | 12592798812 | 20597723520 | 19192721625 | 11174194944 | 4234935936 | 1055020032 | 169962705 | 16896000 | 942348 | 24192 | 169 | 72846528508 | ||
| 14 | 1409933619 | 21599884644 | 83519432100 | 151037460288 | 157818964875 | 104903385444 | 46462800384 | 13958630400 | 2834371683 | 379450500 | 31768308 | 1505088 | 32955 | 196 | 583957620484 | |
| 15 | 7923848253 | 130672946208 | 548277193737 | 1086287459712 | 1258157225325 | 940489437888 | 477082799193 | 168099689472 | 41331607317 | 7007800800 | 794674881 | 56923776 | 2322229 | 43904 | 225 | 4666183972920 |
Compute more
?
Technical details
- Node id
n-59e41483dce6dc4f· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-23befb70208d93ea
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 -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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 3, 4; 3: 13, 32, 9; 4: 63, 228, 135, 16; 5: 321, 1536, 1404, 384, 25; 6: 1683, 10020, 12420, 5440, 875, 36; 7: 8989, 64032, 100305, 60800, 16125, 1728, 49; 8: 48639, 403396, 764127, 593040, 221375, 40068, 3087, 64; 9: 265729, 2514944, 5589360, 5293568, 2558500, 661248, 87808, 5120, 81; 10: 1462563, 15554628, 39679632, 44389632, 26390700, 8917776, 1712256, 175104, 8019, 100;
%F FormulaThe row polynomials satisfy (16*n-16+(40*n^2-82*n+42)*x+(36*n^3-116*n^2+125*n-45)*x^2+(12*n^4-50*n^3+76*n^2-50*n+12)*x^3+(n^5-5*n^4+10*n^3-10*n^2+5*n-1)*x^4)*P(n,x) = (112*n-176+(336*n^2-766*n+366)*x+(300*n^3-728*n^2+323*n+105)*x^2+(92*n^4-160*n^3-138*n^2+278*n-56)*x^3+(7*n^5+21*n^4-129*n^3+149*n^2-45*n+1)*x^4+(3*n^5-9*n^4+5*n^3+5*n^2-4*n)*x^5)*P(n-1,x) - (16+(96*n-72)*x+(120*n^2-28*n-96)*x^2+(48*n^3+100*n^2-182*n+12)*x^3+(4*n^4+68*n^3-64*n^2-40*n+20)*x^4+(6*n^4+18*n^3-46*n^2+20*n)*x^5+(2*n^4-2*n^3-2*n^2+2*n)*x^6)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((112*n - 176 + (336*n^2 - 766*n + 366)*x + (300*n^3 - 728*n^2 + 323*n + 105)*x^2 + (92*n^4 - 160*n^3 - 138*n^2 + 278*n - 56)*x^3 + (7*n^5 + 21*n^4 - 129*n^3 + 149*n^2 - 45*n + 1)*x^4 + (3*n^5 - 9*n^4 + 5*n^3 + 5*n^2 - 4*n)*x^5)*P[n - 1, x] - (16 + (96*n - 72)*x + (120*n^2 - 28*n - 96)*x^2 + (48*n^3 + 100*n^2 - 182*n + 12)*x^3 + (4*n^4 + 68*n^3 - 64*n^2 - 40*n + 20)*x^4 + (6*n^4 + 18*n^3 - 46*n^2 + 20*n)*x^5 + (2*n^4 - 2*n^3 - 2*n^2 + 2*n)*x^6)*D[P[n - 1, x], x])/(16*n - 16 + (40*n^2 - 82*n + 42)*x + (36*n^3 - 116*n^2 + 125*n - 45)*x^2 + (12*n^4 - 50*n^3 + 76*n^2 - 50*n + 12)*x^3 + (n^5 - 5*n^4 + 10*n^3 - 10*n^2 + 5*n - 1)*x^4)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((112*n - 176 + (336*n^2 - 766*n + 366)*x + (300*n^3 - 728*n^2 + 323*n + 105)*x^2 + (92*n^4 - 160*n^3 - 138*n^2 + 278*n - 56)*x^3 + (7*n^5 + 21*n^4 - 129*n^3 + 149*n^2 - 45*n + 1)*x^4 + (3*n^5 - 9*n^4 + 5*n^3 + 5*n^2 - 4*n)*x^5)*v[i - 1] - (16 + (96*n - 72)*x + (120*n^2 - 28*n - 96)*x^2 + (48*n^3 + 100*n^2 - 182*n + 12)*x^3 + (4*n^4 + 68*n^3 - 64*n^2 - 40*n + 20)*x^4 + (6*n^4 + 18*n^3 - 46*n^2 + 20*n)*x^5 + (2*n^4 - 2*n^3 - 2*n^2 + 2*n)*x^6)*deriv(v[i - 1], x))/(16*n - 16 + (40*n^2 - 82*n + 42)*x + (36*n^3 - 116*n^2 + 125*n - 45)*x^2 + (12*n^4 - 50*n^3 + 76*n^2 - 50*n + 12)*x^3 + (n^5 - 5*n^4 + 10*n^3 - 10*n^2 + 5*n - 1)*x^4)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
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 read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
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) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
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