A078812 → basis A013610 → basis A013611
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-1\right)\,P_{n-2}(x) + \left(6 + 12\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 6 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 6 | 12 | 18 | ||||||
| 3 | 35 | 144 | 144 | 323 | |||||
| 4 | 204 | 1272 | 2592 | 1728 | 5796 | ||||
| 5 | 1189 | 9936 | 30672 | 41472 | 20736 | 104005 | |||
| 6 | 6930 | 72612 | 300672 | 615168 | 622080 | 248832 | 1866294 | ||
| 7 | 40391 | 508896 | 2644704 | 7257600 | 11093760 | 8957952 | 2985984 | 33489287 | |
| 8 | 235416 | 3465456 | 21674304 | 74666880 | 153031680 | 186624000 | 125411328 | 35831808 | 600940872 |
Compute more
?
Technical details
- Node id
n-251095b7f718f862· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-cb87bae463f34fa7
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: 6, 12; 3: 35, 144, 144; 4: 204, 1272, 2592, 1728; 5: 1189, 9936, 30672, 41472, 20736; 6: 6930, 72612, 300672, 615168, 622080, 248832; 7: 40391, 508896, 2644704, 7257600, 11093760, 8957952, 2985984; 8: 235416, 3465456, 21674304, 74666880, 153031680, 186624000, 125411328, 35831808; 9: 1372105, 23108832, 168986592, 700835328, 1803098880, 2947166208, 2988969984, 1719926784, 429981696; 10: 7997214, 151652796, 1269551232, 6158184192, 19075585536, 39133559808, 53174403072, 46151368704, 23219011584, 5159780352;
%F FormulaThe row polynomials satisfy P(n,x) = -P(n-2,x) + (6+12*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 6 + 12*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 6 + 12*x;
P[n_, x_] := P[n, x] = Expand[-P[n - 2, x] + (6 + 12*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 6 + 12*x; for(n = 3, N, my(i = n); v[i] = -v[i - 2] + (6 + 12*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, 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_A013610 of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013610 of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).?
References
- [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
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023