A104684 → basis A007318 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - n\right)\,P_{n}(x) = \left(-8 - 16\,x - 8\,x^{2} + 4\,n + 8\,n x + 4\,n x^{2}\right)\,P_{n-2}(x) + \left(12 + 6\,x - 8\,n - 4\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 4 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 4 | 2 | 6 | |||||||||||||
| 3 | 22 | 20 | 4 | 46 | ||||||||||||
| 4 | 136 | 180 | 72 | 8 | 396 | |||||||||||
| 5 | 886 | 1544 | 936 | 224 | 16 | 3606 | ||||||||||
| 6 | 5944 | 12860 | 10480 | 3920 | 640 | 32 | 33876 | |||||||||
| 7 | 40636 | 105048 | 107640 | 55040 | 14400 | 1728 | 64 | 324556 | ||||||||
| 8 | 281488 | 846440 | 1045296 | 679280 | 246400 | 48384 | 4480 | 128 | 3151896 | |||||||
| 9 | 1968934 | 6751760 | 9759568 | 7700672 | 3582880 | 987392 | 152320 | 11264 | 256 | 30915046 | ||||||
| 10 | 13875544 | 53440236 | 88509024 | 82194336 | 46738944 | 16656192 | 3644928 | 456192 | 27648 | 512 | 305543556 | |||||
| 11 | 98365972 | 420390200 | 784906200 | 838713600 | 564076800 | 247121280 | 70439040 | 12625920 | 1313280 | 66560 | 1024 | 3038019876 | ||||
| 12 | 700701808 | 3290590424 | 6837991600 | 8264718000 | 6420268800 | 3341479680 | 1177102080 | 276629760 | 41564160 | 3660800 | 157696 | 2048 | 30354866856 | |||
| 13 | 5011371964 | 25651102320 | 58717006128 | 79202446400 | 69806642400 | 42111083520 | 17694673920 | 5164093440 | 1023390720 | 131225600 | 9934848 | 368640 | 4096 | 304523343996 | ||
| 14 | 35961808432 | 199266393560 | 498192443424 | 741922534496 | 731613625600 | 502153629120 | 245351208960 | 85728614400 | 21191639040 | 3603691520 | 400052224 | 26357760 | 851968 | 8192 | 3065412858696 | |
| 15 | 258805997752 | 1543404868208 | 4184541345712 | 6819362321408 | 7439843162752 | 5726538097280 | 3191757528960 | 1300650024960 | 386259793920 | 82268426240 | 12173185024 | 1183809536 | 68583424 | 1949696 | 16384 | 30946859111256 |
Compute more
?
Technical details
- Node id
n-ee62a53d652921ca· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-50f668b4dcf4d56e
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: 4, 2; 3: 22, 20, 4; 4: 136, 180, 72, 8; 5: 886, 1544, 936, 224, 16; 6: 5944, 12860, 10480, 3920, 640, 32; 7: 40636, 105048, 107640, 55040, 14400, 1728, 64; 8: 281488, 846440, 1045296, 679280, 246400, 48384, 4480, 128; 9: 1968934, 6751760, 9759568, 7700672, 3582880, 987392, 152320, 11264, 256; 10: 13875544, 53440236, 88509024, 82194336, 46738944, 16656192, 3644928, 456192, 27648, 512;
%F FormulaThe row polynomials satisfy -(n-1)*P(n,x) = (4*n-8+(8*n-16)*x+(4*n-8)*x^2)*P(n-2,x) - (8*n-12+(4*n-6)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 4 + 2*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 4 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 8 + (8*n - 16)*x + (4*n - 8)*x^2)*P[n - 2, x] - (8*n - 12 + (4*n - 6)*x)*P[n - 1, x])/(-n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 4 + 2*x; for(n = 3, N, my(i = n); v[i] = ((4*n - 8 + (8*n - 16)*x + (4*n - 8)*x^2)*v[i - 2] - (8*n - 12 + (4*n - 6)*x)*v[i - 1])/(-n + 1)); 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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (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,…?
-
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,…?
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