A120909 → basis A008277
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 3 | 3 | |||||||
| 1 | 9 | 6 | 15 | ||||||
| 2 | 27 | 48 | 12 | 87 | |||||
| 3 | 81 | 294 | 180 | 24 | 579 | ||||
| 4 | 243 | 1632 | 1848 | 576 | 48 | 4347 | |||
| 5 | 729 | 8646 | 16200 | 8880 | 1680 | 96 | 36231 | ||
| 6 | 2187 | 44688 | 130692 | 112320 | 36240 | 4608 | 192 | 330927 | |
| 7 | 6561 | 227814 | 1004220 | 1272264 | 623280 | 132384 | 12096 | 384 | 3279003 |
Computed in your browser ?
Technical details
- Node id
n-20d6880016d8135a· revision 1 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-5162632e955115eb
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 ℚ): 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: 3; 1: 9, 6; 2: 27, 48, 12; 3: 81, 294, 180, 24; 4: 243, 1632, 1848, 576, 48; 5: 729, 8646, 16200, 8880, 1680, 96; 6: 2187, 44688, 130692, 112320, 36240, 4608, 192; 7: 6561, 227814, 1004220, 1272264, 623280, 132384, 12096, 384; 8: 19683, 1152192, 7485168, 13458816, 9400608, 2967552, 446208, 30720, 768; 9: 59049, 5800326, 54700560, 136099680, 130324320, 57379392, 12628224, 1414656, 76032, 1536;
%F FormulaThe row polynomials satisfy P(n,x) = (3+2*x)*P(n-1,x) + 2*x*d/dx 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 + 2*x)*P[n - 1, x] + 2*x*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] = 3; for(n = 1, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 1] + 2*x*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, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-1fc5789fa458cf8e -
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-1fc5789fa458cf8e -
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-1fc5789fa458cf8e
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
-
basis_map A008277
e-1fc5789fa458cf8eRay basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
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]
-
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…
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741