A038323 → 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 | 9 | 21 | |||||||
| 1 | 132 | 207 | 81 | 420 | ||||||
| 2 | 1452 | 3465 | 2754 | 729 | 8400 | |||||
| 3 | 15972 | 51183 | 61479 | 32805 | 6561 | 168000 | ||||
| 4 | 175692 | 706761 | 1136916 | 914166 | 367416 | 59049 | 3360000 | |||
| 5 | 1932612 | 9355599 | 18866925 | 20288070 | 12269070 | 3956283 | 531441 | 67200000 | ||
| 6 | 21258732 | 120305097 | 291736566 | 392971095 | 317552400 | 153940743 | 41452398 | 4782969 | 1344000000 | |
| 7 | 233846052 | 1514684655 | 4291848099 | 6948311139 | 7029816255 | 4551319773 | 1841443065 | 425684241 | 43046721 | 26880000000 |
Computed in your browser ?
Technical details
- Node id
n-1438be315d9d27d7· revision 1 · JSON- Definition source
derived:obreschkoff_combination- Fingerprint
f6-9957a1cf35786f48
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 ?
- A168698: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168746: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168842: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A167933: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168938: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168794: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168986: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168890: 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, 9; 1: 132, 207, 81; 2: 1452, 3465, 2754, 729; 3: 15972, 51183, 61479, 32805, 6561; 4: 175692, 706761, 1136916, 914166, 367416, 59049; 5: 1932612, 9355599, 18866925, 20288070, 12269070, 3956283, 531441; 6: 21258732, 120305097, 291736566, 392971095, 317552400, 153940743, 41452398, 4782969; 7: 233846052, 1514684655, 4291848099, 6948311139, 7029816255, 4551319773, 1841443065, 425684241, 43046721; 8: 2572306572, 18766145673, 60842490984, 115058055420, 139862779056, 113332863798, 61217751672, 21255514236, 4304672100, 387420489; 9: 28295372292, 229578361551, 838162711881, 1813221028476, 2574013068396, 2505426513282, 1693391042574, 784770421644, 238651021224, 43003674279, 3486784401;
%F FormulaThe row polynomials satisfy P(n,x) = (11+9*x)*P(n-1,x) for n >= 1, with P(0,x) = 12 + 9*x.
%t MathematicaP[0, x_] := 12 + 9*x;
P[n_, x_] := P[n, x] = Expand[(11 + 9*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 + 9*x; for(n = 1, N, my(i = n + 1); v[i] = (11 + 9*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-316947e1f7e184b6
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-316947e1f7e184b6Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*9^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
-
theorem_check liu_wang
e-3b00b07e8aa23801root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-896c34b831f8e9e4root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*9^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)*9^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.