A104684 → basis A013611 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4 + 42\,x - 180\,x^{2} + 192\,x^{3} - 64\,x^{4} + 4\,n - 82\,n x + 500\,n x^{2} - 800\,n x^{3} + 320\,n x^{4} + 40\,n^{2} x - 464\,n^{2} x^{2} + 1216\,n^{2} x^{3} - 640\,n^{2} x^{4} + 144\,n^{3} x^{2} - 800\,n^{3} x^{3} + 640\,n^{3} x^{4} + 192\,n^{4} x^{3} - 320\,n^{4} x^{4} + 64\,n^{5} x^{4}\right)\,P_{n}(x) = \left(-44 + 366\,x + 420\,x^{2} - 896\,x^{3} + 64\,x^{4} + 28\,n - 766\,n x + 1292\,n x^{2} + 4448\,n x^{3} - 2880\,n x^{4} - 1024\,n x^{5} + 336\,n^{2} x - 2912\,n^{2} x^{2} - 2208\,n^{2} x^{3} + 9536\,n^{2} x^{4} + 1280\,n^{2} x^{5} + 1200\,n^{3} x^{2} - 2560\,n^{3} x^{3} - 8256\,n^{3} x^{4} + 1280\,n^{3} x^{5} + 1472\,n^{4} x^{3} + 1344\,n^{4} x^{4} - 2304\,n^{4} x^{5} + 448\,n^{5} x^{4} + 768\,n^{5} x^{5}\right)\,P_{n-1}(x) + \left(-1 + 18\,x + 96\,x^{2} - 48\,x^{3} - 320\,x^{4} - 24\,n x + 28\,n x^{2} + 728\,n x^{3} + 640\,n x^{4} - 1280\,n x^{5} - 512\,n x^{6} - 120\,n^{2} x^{2} - 400\,n^{2} x^{3} + 1024\,n^{2} x^{4} + 2944\,n^{2} x^{5} + 512\,n^{2} x^{6} - 192\,n^{3} x^{3} - 1088\,n^{3} x^{4} - 1152\,n^{3} x^{5} + 512\,n^{3} x^{6} - 64\,n^{4} x^{4} - 384\,n^{4} x^{5} - 512\,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 | 16 | 19 | |||||||||||||
| 3 | 13 | 128 | 144 | 285 | ||||||||||||
| 4 | 63 | 912 | 2160 | 1024 | 4159 | |||||||||||
| 5 | 321 | 6144 | 22464 | 24576 | 6400 | 59905 | ||||||||||
| 6 | 1683 | 40080 | 198720 | 348160 | 224000 | 36864 | 849507 | |||||||||
| 7 | 8989 | 256128 | 1604880 | 3891200 | 4128000 | 1769472 | 200704 | 11859373 | ||||||||
| 8 | 48639 | 1613584 | 12226032 | 37954560 | 56672000 | 41029632 | 12644352 | 1048576 | 163237375 | |||||||
| 9 | 265729 | 10059776 | 89429760 | 338788352 | 654976000 | 677117952 | 359661568 | 83886080 | 5308416 | 2219493633 | ||||||
| 10 | 1462563 | 62218512 | 634874112 | 2840936448 | 6756019200 | 9131802624 | 7013400576 | 2868903936 | 525533184 | 26214400 | 29861365555 | |||||
| 11 | 8097453 | 382400640 | 4404825360 | 22742138880 | 64267392000 | 107612209152 | 108994314240 | 65179484160 | 21260206080 | 3145728000 | 126877696 | 398123673661 | ||||
| 12 | 45046719 | 2338343568 | 30011232240 | 175638144000 | 575355264000 | 1151000395776 | 1453375537152 | 1155048407040 | 556189286400 | 148504576000 | 18143510528 | 603979776 | 5266253723199 | |||
| 13 | 251595969 | 14238849024 | 201484780992 | 1318254305280 | 4913336736000 | 11442375622656 | 17346297593856 | 17285448204288 | 11138675834880 | 4429185024000 | 988123496448 | 101468602368 | 2835349504 | 69181975995265 | ||
| 14 | 1409933619 | 86399538576 | 1336310913600 | 9666397458432 | 40401655008000 | 107421066694656 | 190311630372864 | 228698200473600 | 185753382617088 | 99470671872000 | 33311485329408 | 6312796618752 | 552893153280 | 13153337344 | 903337453321219 | |
| 15 | 7923848253 | 522691784832 | 8772435099792 | 69522397421568 | 322088249683200 | 963061184397312 | 1954131145494528 | 2754145312309248 | 2708708217126912 | 1837052932915200 | 833277008019456 | 238755621371904 | 38960537534464 | 2946347565056 | 60397977600 | 11732012402549325 |
Compute more
?
Technical details
- Node id
n-3f87f13d0f813f00· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-fcf88ff765517704
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, 16; 3: 13, 128, 144; 4: 63, 912, 2160, 1024; 5: 321, 6144, 22464, 24576, 6400; 6: 1683, 40080, 198720, 348160, 224000, 36864; 7: 8989, 256128, 1604880, 3891200, 4128000, 1769472, 200704; 8: 48639, 1613584, 12226032, 37954560, 56672000, 41029632, 12644352, 1048576; 9: 265729, 10059776, 89429760, 338788352, 654976000, 677117952, 359661568, 83886080, 5308416; 10: 1462563, 62218512, 634874112, 2840936448, 6756019200, 9131802624, 7013400576, 2868903936, 525533184, 26214400;
%F FormulaThe row polynomials satisfy (4*n-4+(40*n^2-82*n+42)*x+(144*n^3-464*n^2+500*n-180)*x^2+(192*n^4-800*n^3+1216*n^2-800*n+192)*x^3+(64*n^5-320*n^4+640*n^3-640*n^2+320*n-64)*x^4)*P(n,x) = (28*n-44+(336*n^2-766*n+366)*x+(1200*n^3-2912*n^2+1292*n+420)*x^2+(1472*n^4-2560*n^3-2208*n^2+4448*n-896)*x^3+(448*n^5+1344*n^4-8256*n^3+9536*n^2-2880*n+64)*x^4+(768*n^5-2304*n^4+1280*n^3+1280*n^2-1024*n)*x^5)*P(n-1,x) - (1+(24*n-18)*x+(120*n^2-28*n-96)*x^2+(192*n^3+400*n^2-728*n+48)*x^3+(64*n^4+1088*n^3-1024*n^2-640*n+320)*x^4+(384*n^4+1152*n^3-2944*n^2+1280*n)*x^5+(512*n^4-512*n^3-512*n^2+512*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[((28*n - 44 + (336*n^2 - 766*n + 366)*x + (1200*n^3 - 2912*n^2 + 1292*n + 420)*x^2 + (1472*n^4 - 2560*n^3 - 2208*n^2 + 4448*n - 896)*x^3 + (448*n^5 + 1344*n^4 - 8256*n^3 + 9536*n^2 - 2880*n + 64)*x^4 + (768*n^5 - 2304*n^4 + 1280*n^3 + 1280*n^2 - 1024*n)*x^5)*P[n - 1, x] - (1 + (24*n - 18)*x + (120*n^2 - 28*n - 96)*x^2 + (192*n^3 + 400*n^2 - 728*n + 48)*x^3 + (64*n^4 + 1088*n^3 - 1024*n^2 - 640*n + 320)*x^4 + (384*n^4 + 1152*n^3 - 2944*n^2 + 1280*n)*x^5 + (512*n^4 - 512*n^3 - 512*n^2 + 512*n)*x^6)*D[P[n - 1, x], x])/(4*n - 4 + (40*n^2 - 82*n + 42)*x + (144*n^3 - 464*n^2 + 500*n - 180)*x^2 + (192*n^4 - 800*n^3 + 1216*n^2 - 800*n + 192)*x^3 + (64*n^5 - 320*n^4 + 640*n^3 - 640*n^2 + 320*n - 64)*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] = ((28*n - 44 + (336*n^2 - 766*n + 366)*x + (1200*n^3 - 2912*n^2 + 1292*n + 420)*x^2 + (1472*n^4 - 2560*n^3 - 2208*n^2 + 4448*n - 896)*x^3 + (448*n^5 + 1344*n^4 - 8256*n^3 + 9536*n^2 - 2880*n + 64)*x^4 + (768*n^5 - 2304*n^4 + 1280*n^3 + 1280*n^2 - 1024*n)*x^5)*v[i - 1] - (1 + (24*n - 18)*x + (120*n^2 - 28*n - 96)*x^2 + (192*n^3 + 400*n^2 - 728*n + 48)*x^3 + (64*n^4 + 1088*n^3 - 1024*n^2 - 640*n + 320)*x^4 + (384*n^4 + 1152*n^3 - 2944*n^2 + 1280*n)*x^5 + (512*n^4 - 512*n^3 - 512*n^2 + 512*n)*x^6)*deriv(v[i - 1], x))/(4*n - 4 + (40*n^2 - 82*n + 42)*x + (144*n^3 - 464*n^2 + 500*n - 180)*x^2 + (192*n^4 - 800*n^3 + 1216*n^2 - 800*n + 192)*x^3 + (64*n^5 - 320*n^4 + 640*n^3 - 640*n^2 + 320*n - 64)*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_A013611 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 ›
-
-
from
basis_map_A013611 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