A103327 → reverse → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + 2\,n\right)\,P_{n}(x) = \left(-4 - 3\,x + 8\,n + 6\,n x\right)\,P_{n-1}(x) + \left(-4\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 3 | 7 | ||||||
| 2 | 16 | 20 | 5 | 41 | |||||
| 3 | 64 | 112 | 56 | 7 | 239 | ||||
| 4 | 256 | 576 | 432 | 120 | 9 | 1393 | |||
| 5 | 1024 | 2816 | 2816 | 1232 | 220 | 11 | 8119 | ||
| 6 | 4096 | 13312 | 16640 | 9984 | 2912 | 364 | 13 | 47321 | |
| 7 | 16384 | 61440 | 92160 | 70400 | 28800 | 6048 | 560 | 15 | 275807 |
Compute more
?
Technical details
- Node id
n-d007580595bb987a· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-3f225bab20c1f22f
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: 4, 3; 2: 16, 20, 5; 3: 64, 112, 56, 7; 4: 256, 576, 432, 120, 9; 5: 1024, 2816, 2816, 1232, 220, 11; 6: 4096, 13312, 16640, 9984, 2912, 364, 13; 7: 16384, 61440, 92160, 70400, 28800, 6048, 560, 15; 8: 65536, 278528, 487424, 452608, 239360, 71808, 11424, 816, 17; 9: 262144, 1245184, 2490368, 2723840, 1770496, 695552, 160512, 20064, 1140, 19;
%F FormulaThe row polynomials satisfy (2*n-1)*P(n,x) = (8*n-4+(6*n-3)*x)*P(n-1,x) - (4*x+4*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n - 4 + (6*n - 3)*x)*P[n - 1, x] - (4*x + 4*x^2)*D[P[n - 1, x], x])/(2*n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((8*n - 4 + (6*n - 3)*x)*v[i - 1] - (4*x + 4*x^2)*deriv(v[i - 1], x))/(2*n - 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
Related ?
Same fingerprint ?
- A103327 → x ↦ x/(x+1)
- A091042 → basis A007318 → reverse
- A091042 → basis A007318
- A091042 → reverse → x ↦ x/(x+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