A104684 → basis A013611 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + 6\,x - 8\,x^{2} + 2\,n - 14\,n x + 24\,n x^{2} + 8\,n^{2} x - 24\,n^{2} x^{2} + 8\,n^{3} x^{2}\right)\,P_{n}(x) = \left(-22 + 18\,x + 152\,x^{2} + 64\,x^{3} + 14\,n - 114\,n x - 232\,n x^{2} + 64\,n x^{3} + 64\,n^{2} x - 8\,n^{2} x^{2} - 224\,n^{2} x^{3} + 56\,n^{3} x^{2} + 96\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-1 + 32\,x^{2} + 72\,x^{3} + 32\,x^{4} - 8\,n x - 44\,n x^{2} - 40\,n x^{3} + 32\,n x^{4} - 8\,n^{2} x^{2} - 48\,n^{2} x^{3} - 64\,n^{2} x^{4}\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 | 8 | 11 | |||||||||||||
| 3 | 13 | 64 | 48 | 125 | ||||||||||||
| 4 | 63 | 456 | 720 | 256 | 1495 | |||||||||||
| 5 | 321 | 3072 | 7488 | 6144 | 1280 | 18305 | ||||||||||
| 6 | 1683 | 20040 | 66240 | 87040 | 44800 | 6144 | 225947 | |||||||||
| 7 | 8989 | 128064 | 534960 | 972800 | 825600 | 294912 | 28672 | 2793997 | ||||||||
| 8 | 48639 | 806792 | 4075344 | 9488640 | 11334400 | 6838272 | 1806336 | 131072 | 34529495 | |||||||
| 9 | 265729 | 5029888 | 29809920 | 84697088 | 130995200 | 112852992 | 51380224 | 10485760 | 589824 | 426106625 | ||||||
| 10 | 1462563 | 31109256 | 211624704 | 710234112 | 1351203840 | 1521967104 | 1001914368 | 358612992 | 58392576 | 2621440 | 5249142955 | |||||
| 11 | 8097453 | 191200320 | 1468275120 | 5685534720 | 12853478400 | 17935368192 | 15570616320 | 8147435520 | 2362245120 | 314572800 | 11534336 | 64548358301 | ||||
| 12 | 45046719 | 1169171784 | 10003744080 | 43909536000 | 115071052800 | 191833399296 | 207625076736 | 144381050880 | 61798809600 | 14850457600 | 1649410048 | 50331648 | 792387087191 | |||
| 13 | 251595969 | 7119424512 | 67161593664 | 329563576320 | 982667347200 | 1907062603776 | 2478042513408 | 2160681025536 | 1237630648320 | 442918502400 | 89829408768 | 8455716864 | 218103808 | 9711602060545 | ||
| 14 | 1409933619 | 43199769288 | 445436971200 | 2416599364608 | 8080331001600 | 17903511115776 | 27187375767552 | 28587275059200 | 20639264735232 | 9947067187200 | 3028316848128 | 526066384896 | 42530242560 | 939524096 | 118849323904955 | |
| 15 | 7923848253 | 261345892416 | 2924145033264 | 17380599355392 | 64417649936640 | 160510197399552 | 279161592213504 | 344268164038656 | 300967579680768 | 183705293291520 | 75752455274496 | 19896301780992 | 2996964425728 | 210453397504 | 4026531840 | 1452464692100525 |
Compute more
?
Technical details
- Node id
n-0f84e233ec4cc845· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-f9fc0a64807f736f
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, 8; 3: 13, 64, 48; 4: 63, 456, 720, 256; 5: 321, 3072, 7488, 6144, 1280; 6: 1683, 20040, 66240, 87040, 44800, 6144; 7: 8989, 128064, 534960, 972800, 825600, 294912, 28672; 8: 48639, 806792, 4075344, 9488640, 11334400, 6838272, 1806336, 131072; 9: 265729, 5029888, 29809920, 84697088, 130995200, 112852992, 51380224, 10485760, 589824; 10: 1462563, 31109256, 211624704, 710234112, 1351203840, 1521967104, 1001914368, 358612992, 58392576, 2621440;
%F FormulaThe row polynomials satisfy (2*n-2+(8*n^2-14*n+6)*x+(8*n^3-24*n^2+24*n-8)*x^2)*P(n,x) = (14*n-22+(64*n^2-114*n+18)*x+(56*n^3-8*n^2-232*n+152)*x^2+(96*n^3-224*n^2+64*n+64)*x^3)*P(n-1,x) - (1+8*n*x+(8*n^2+44*n-32)*x^2+(48*n^2+40*n-72)*x^3+(64*n^2-32*n-32)*x^4)*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[((14*n - 22 + (64*n^2 - 114*n + 18)*x + (56*n^3 - 8*n^2 - 232*n + 152)*x^2 + (96*n^3 - 224*n^2 + 64*n + 64)*x^3)*P[n - 1, x] - (1 + 8*n*x + (8*n^2 + 44*n - 32)*x^2 + (48*n^2 + 40*n - 72)*x^3 + (64*n^2 - 32*n - 32)*x^4)*D[P[n - 1, x], x])/(2*n - 2 + (8*n^2 - 14*n + 6)*x + (8*n^3 - 24*n^2 + 24*n - 8)*x^2)]];
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] = ((14*n - 22 + (64*n^2 - 114*n + 18)*x + (56*n^3 - 8*n^2 - 232*n + 152)*x^2 + (96*n^3 - 224*n^2 + 64*n + 64)*x^3)*v[i - 1] - (1 + 8*n*x + (8*n^2 + 44*n - 32)*x^2 + (48*n^2 + 40*n - 72)*x^3 + (64*n^2 - 32*n - 32)*x^4)*deriv(v[i - 1], x))/(2*n - 2 + (8*n^2 - 14*n + 6)*x + (8*n^3 - 24*n^2 + 24*n - 8)*x^2)); 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,…?
Related ?
Same fingerprint ?
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