A120910 → basis A007318
nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 3 | 3 | |||||||
| 1 | 9 | 3 | 12 | ||||||
| 2 | 27 | 18 | 3 | 48 | |||||
| 3 | 81 | 81 | 27 | 3 | 192 | ||||
| 4 | 243 | 324 | 162 | 36 | 3 | 768 | |||
| 5 | 729 | 1215 | 810 | 270 | 45 | 3 | 3072 | ||
| 6 | 2187 | 4374 | 3645 | 1620 | 405 | 54 | 3 | 12288 | |
| 7 | 6561 | 15309 | 15309 | 8505 | 2835 | 567 | 63 | 3 | 49152 |
Generated b-files: A164346 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-a22bdff1819212bb· revision 2 · JSON- Definition source
derived:basis_map_A007318- Fingerprint
f6-f9762973ec1089d7
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 ℚ): yes
OEIS matches ?
- A092898: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A002001: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A110594: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A259031: row sums, 12 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A164346: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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: 3; 1: 9, 3; 2: 27, 18, 3; 3: 81, 81, 27, 3; 4: 243, 324, 162, 36, 3; 5: 729, 1215, 810, 270, 45, 3; 6: 2187, 4374, 3645, 1620, 405, 54, 3; 7: 6561, 15309, 15309, 8505, 2835, 567, 63, 3; 8: 19683, 52488, 61236, 40824, 17010, 4536, 756, 72, 3; 9: 59049, 177147, 236196, 183708, 91854, 30618, 6804, 972, 81, 3;
%F FormulaThe row polynomials satisfy P(n,x) = (3+x)*P(n-1,x) for n >= 1, with P(0,x) = 3.
%t MathematicaP[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[(3 + 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] = 3; for(n = 1, N, my(i = n + 1); v[i] = (3 + 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, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-18f137fab6db112d -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-18f137fab6db112d,e-70398ca31bda4d7a -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-18f137fab6db112d,e-70398ca31bda4d7a -
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-70398ca31bda4d7a -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-70398ca31bda4d7a
Proof chains
2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
basis_map A007318
e-18f137fab6db112dGeometric basis map (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-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]
-
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-f91a02f39edc297froot: theorem checkParent-row provers of polytool 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…
-
-
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…
-
preserver_image affine, shift 0
e-70398ca31bda4d7aAffine, 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]
-
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…
Related sequences ?
Same fingerprint (16)
Equal up to content, sign, reversal and a small index shift.
- basis-map coefficients of A112227 → basis A013610
- A136572 → basis A013610
- basis-map coefficients of A021012 → basis A013610
- basis-map coefficients of A030528, shifted → basis A013610
- A027465: Cube of lower triangular normalized binomial matrix.
- A130123 → basis A013610
- basis-map coefficients of A026729 → basis A013610
- basis-map coefficients of A026729, shifted → basis A013610
- A027465 → D
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*4^j.
- A120909 → x ↦ x/(x+1)
- A013610 → D
- A038279 → basis A013610
- A013610 → basis A013611
- A013610: Triangle of coefficients in expansion of (1+3*x)^n.
- A038243 → basis A013609
References
- [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