A038322 → Pₙ + Pₙ₊₁
nonnegative coefficients only rational roots
Proved for all n: all roots real what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 12 | 8 | 20 | |||||||
| 1 | 132 | 184 | 64 | 380 | ||||||
| 2 | 1452 | 3080 | 2176 | 512 | 7220 | |||||
| 3 | 15972 | 45496 | 48576 | 23040 | 4096 | 137180 | ||||
| 4 | 175692 | 628232 | 898304 | 642048 | 229376 | 32768 | 2606420 | |||
| 5 | 1932612 | 8316088 | 14907200 | 14248960 | 7659520 | 2195456 | 262144 | 49521980 | ||
| 6 | 21258732 | 106937864 | 230507904 | 275996160 | 198246400 | 85426176 | 20447232 | 2097152 | 940917620 | |
| 7 | 233846052 | 1346386360 | 3391089856 | 4880020992 | 4388679680 | 2525659136 | 908328960 | 186646528 | 16777216 | 17877434780 |
Computed in your browser ?
Technical details
- Node id
n-92d05df66a553ff7· revision 1 · JSON- Definition source
derived:obreschkoff_combination- Fingerprint
f6-f7279d99fdb813e1
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 ℚ): yes
OEIS matches ?
- A168697: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168841: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A167931: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168793: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168745: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168985: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168889: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168937: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
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: 12, 8; 1: 132, 184, 64; 2: 1452, 3080, 2176, 512; 3: 15972, 45496, 48576, 23040, 4096; 4: 175692, 628232, 898304, 642048, 229376, 32768; 5: 1932612, 8316088, 14907200, 14248960, 7659520, 2195456, 262144; 6: 21258732, 106937864, 230507904, 275996160, 198246400, 85426176, 20447232, 2097152; 7: 233846052, 1346386360, 3391089856, 4880020992, 4388679680, 2525659136, 908328960, 186646528, 16777216; 8: 2572306572, 16681018376, 48073079296, 80808949760, 87315644416, 62891687936, 30196891648, 9319743488, 1677721600, 134217728; 9: 28295372292, 204069654712, 662252019264, 1273483081728, 1606943686656, 1390333722624, 835299311616, 344092311552, 93012885504, 14898167808, 1073741824;
%F FormulaThe row polynomials satisfy P(n,x) = (11+8*x)*P(n-1,x) for n >= 1, with P(0,x) = 12 + 8*x.
%t MathematicaP[0, x_] := 12 + 8*x;
P[n_, x_] := P[n, x] = Expand[(11 + 8*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] = 12 + 8*x; for(n = 1, N, my(i = n + 1); v[i] = (11 + 8*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)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-991e7bd9709a3127
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-991e7bd9709a3127Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*8^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
-
theorem_check liu_wang
e-b1ed3dc68c32d118root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-6bd8c236b8a4d918root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*8^j.
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1no recorded property covers this requirement
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*8^j.
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.