A257623 → Pₙ + Pₙ₊₁
nonnegative coefficients
Proved for all n: all roots real what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 4 | 3 | 7 | |||||||
| 1 | 12 | 51 | 9 | 72 | ||||||
| 2 | 36 | 549 | 510 | 27 | 1122 | |||||
| 3 | 108 | 4995 | 13527 | 4521 | 81 | 23232 | ||||
| 4 | 324 | 42309 | 263256 | 254724 | 37896 | 243 | 598752 | |||
| 5 | 972 | 347139 | 4372965 | 9258510 | 4160550 | 309567 | 729 | 18450432 | ||
| 6 | 2916 | 2807973 | 66379362 | 265980225 | 261094680 | 62565951 | 2499378 | 2187 | 661332672 | |
| 7 | 8748 | 22570947 | 954048195 | 6625652511 | 12077681415 | 6430937193 | 894290217 | 20074485 | 6561 | 27025270272 |
Computed in your browser ?
Technical details
- Node id
n-87279d476dd56af6· revision 1 · JSON- Definition source
derived:obreschkoff_combination- Fingerprint
f6-f39d02caa69ffdbe
Observed on the stored rows ?
- Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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
OEIS matches ?
No OEIS matches.
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 4, 3; 1: 12, 51, 9; 2: 36, 549, 510, 27; 3: 108, 4995, 13527, 4521, 81; 4: 324, 42309, 263256, 254724, 37896, 243; 5: 972, 347139, 4372965, 9258510, 4160550, 309567, 729; 6: 2916, 2807973, 66379362, 265980225, 261094680, 62565951, 2499378, 2187; 7: 8748, 22570947, 954048195, 6625652511, 12077681415, 6430937193, 894290217, 20074485, 6561; 8: 26244, 180932805, 13247829276, 150434052498, 462020083128, 456568054224, 144957163500, 12376110006, 160867068, 19683; 9: 78732, 1448689347, 179901529713, 3206771499612, 15558942241548, 25661364298506, 15252808239822, 3075062165388, 167706352512, 1287848523, 59049;
%F FormulaThe row polynomials satisfy P(n,x) = (3+(5*n-7)*x)*P(n-2,x) + (5*x-5*x^2)*d/dx P(n-2,x) + (2+(5*n+3)*x)*P(n-1,x) + (5*x-5*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 4 + 3*x, P(1,x) = 12 + 51*x + 9*x^2.
%t MathematicaP[0, x_] := 4 + 3*x;
P[1, x_] := 12 + 51*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[(3 + (5*n - 7)*x)*P[n - 2, x] + (5*x - 5*x^2)*D[P[n - 2, x], x] + (2 + (5*n + 3)*x)*P[n - 1, x] + (5*x - 5*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 4 + 3*x; v[2] = 12 + 51*x + 9*x^2; for(n = 2, N, my(i = n + 1); v[i] = (3 + (5*n - 7)*x)*v[i - 2] + (5*x - 5*x^2)*deriv(v[i - 2], x) + (2 + (5*n + 3)*x)*v[i - 1] + (5*x - 5*x^2)*deriv(v[i - 1], x)); 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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-fccdbe2b7271fb46
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
obreschkoff_combination
e-fccdbe2b7271fb46Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
-
premise (sequence):
Triangle read by rows: T(n,k) = t(n-k, k), where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1) and f(n) = 5*n + 3.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
-
theorem_check liu_wang
e-d9277c75939e8d2froot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
-
premise (sequence):
Triangle read by rows: T(n,k) = t(n-k, k), where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1) and f(n) = 5*n + 3.
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1no recorded property covers this requirement
-
premise (sequence):
Triangle read by rows: T(n,k) = t(n-k, k), where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1) and f(n) = 5*n + 3.
Related sequences ?
No candidate equalities or related sequences.
References
- [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
- [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
- [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.