A232535 → basis A013610 → basis A013610
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-9 - 54\,x - 81\,x^{2}\right)\,P_{n-2}(x) + \left(10 + 18\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 9 + 18\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 9 | 18 | 27 | ||||||
| 2 | 81 | 288 | 243 | 612 | |||||
| 3 | 729 | 3690 | 5913 | 2916 | 13248 | ||||
| 4 | 6561 | 43056 | 101250 | 99144 | 32805 | 282816 | |||
| 5 | 59049 | 476082 | 1475982 | 2169504 | 1476225 | 354294 | 6011136 | ||
| 6 | 531441 | 5081904 | 19561581 | 38415384 | 39963051 | 20312856 | 3720087 | 127586304 | |
| 7 | 4782969 | 52911594 | 243314847 | 598471092 | 841113639 | 663828858 | 264126177 | 38263752 | 2706812928 |
Compute more
?
Technical details
- Node id
n-4182d3b7552bf009· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-e01ea07d291a6f88
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 0)
- 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 9, 18; 2: 81, 288, 243; 3: 729, 3690, 5913, 2916; 4: 6561, 43056, 101250, 99144, 32805; 5: 59049, 476082, 1475982, 2169504, 1476225, 354294; 6: 531441, 5081904, 19561581, 38415384, 39963051, 20312856, 3720087; 7: 4782969, 52911594, 243314847, 598471092, 841113639, 663828858, 264126177, 38263752; 8: 43046721, 540774432, 2892033396, 8550680112, 15165029790, 16325867520, 10222799076, 3290682672, 387420489; 9: 387420489, 5448100626, 33219793548, 114752321568, 245966575590, 336358456740, 289739507436, 148539885264, 39646030041, 3874204890;
%F FormulaThe row polynomials satisfy P(n,x) = -(9+54*x+81*x^2)*P(n-2,x) + (10+18*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 9 + 18*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 9 + 18*x;
P[n_, x_] := P[n, x] = Expand[-(9 + 54*x + 81*x^2)*P[n - 2, x] + (10 + 18*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 9 + 18*x; for(n = 2, N, my(i = n + 1); v[i] = -(9 + 54*x + 81*x^2)*v[i - 2] + (10 + 18*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 - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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 ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.?
-
-
from
basis_map_A013610 of Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+…?
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