A120909 → 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 | x9 | x10 | x11 | x12 | x13 | x14 | x15 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 6 | 6 | 12 | ||||||||||||||
| 1 | 6 | 18 | 12 | 36 | |||||||||||||
| 2 | 6 | 30 | 48 | 24 | 108 | ||||||||||||
| 3 | 6 | 42 | 108 | 120 | 48 | 324 | |||||||||||
| 4 | 6 | 54 | 192 | 336 | 288 | 96 | 972 | ||||||||||
| 5 | 6 | 66 | 300 | 720 | 960 | 672 | 192 | 2916 | |||||||||
| 6 | 6 | 78 | 432 | 1320 | 2400 | 2592 | 1536 | 384 | 8748 | ||||||||
| 7 | 6 | 90 | 588 | 2184 | 5040 | 7392 | 6720 | 3456 | 768 | 26244 | |||||||
| 8 | 6 | 102 | 768 | 3360 | 9408 | 17472 | 21504 | 16896 | 7680 | 1536 | 78732 | ||||||
| 9 | 6 | 114 | 972 | 4896 | 16128 | 36288 | 56448 | 59904 | 41472 | 16896 | 3072 | 236196 | |||||
| 10 | 6 | 126 | 1200 | 6840 | 25920 | 68544 | 129024 | 172800 | 161280 | 99840 | 36864 | 6144 | 708588 | ||||
| 11 | 6 | 138 | 1452 | 9240 | 39600 | 120384 | 266112 | 430848 | 506880 | 422400 | 236544 | 79872 | 12288 | 2125764 | |||
| 12 | 6 | 150 | 1728 | 12144 | 58080 | 199584 | 506880 | 963072 | 1368576 | 1436160 | 1081344 | 552960 | 172032 | 24576 | 6377292 | ||
| 13 | 6 | 162 | 2028 | 15600 | 82368 | 315744 | 906048 | 1976832 | 3294720 | 4173312 | 3953664 | 2715648 | 1277952 | 368640 | 49152 | 19131876 | |
| 14 | 6 | 174 | 2352 | 19656 | 113568 | 480480 | 1537536 | 3788928 | 7248384 | 10762752 | 12300288 | 10622976 | 6709248 | 2924544 | 786432 | 98304 | 57395628 |
Computed in your browser ?
Technical details
- Node id
n-4a90276c6d0931df· revision 1 · JSON- Definition source
derived:obreschkoff_combination- Fingerprint
f6-04668acf2e74f66d
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 ?
- A168825: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A025579: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A003946: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A027327: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168729: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A052156: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168777: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A168681: 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: 6, 6; 1: 6, 18, 12; 2: 6, 30, 48, 24; 3: 6, 42, 108, 120, 48; 4: 6, 54, 192, 336, 288, 96; 5: 6, 66, 300, 720, 960, 672, 192; 6: 6, 78, 432, 1320, 2400, 2592, 1536, 384; 7: 6, 90, 588, 2184, 5040, 7392, 6720, 3456, 768; 8: 6, 102, 768, 3360, 9408, 17472, 21504, 16896, 7680, 1536; 9: 6, 114, 972, 4896, 16128, 36288, 56448, 59904, 41472, 16896, 3072;
%F FormulaThe row polynomials satisfy P(n,x) = (1+2*x)*P(n-1,x) for n >= 1, with P(0,x) = 6 + 6*x.
%t MathematicaP[0, x_] := 6 + 6*x;
P[n_, x_] := P[n, x] = Expand[(1 + 2*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] = 6 + 6*x; for(n = 1, N, my(i = n + 1); v[i] = (1 + 2*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-6efef9a3e4d28a62
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-6efef9a3e4d28a62Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
-
theorem_check liu_wang
e-f5018d5f4ba5a310root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-98e1992c4c48b815Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-26e15e96a906c1dfroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-3e9b67ef5f31843croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-b63d4680864933c7Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-f5018d5f4ba5a310(expanded above) -
parent_provers periodic_product
e-f91a02f39edc297froot: theorem checkParent-row provers of polytool polytool ?
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…
-
↵ parent_provers periodic_product
e-f91a02f39edc297f(expanded above)
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
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) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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.