A038284 → basis A013610
nonnegative coefficients only rational roots
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 | x8 | x9 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 196 | 504 | 324 | 1024 | |||||||
| 1 | 2744 | 10584 | 13608 | 5832 | 32768 | ||||||
| 2 | 38416 | 197568 | 381024 | 326592 | 104976 | 1048576 | |||||
| 3 | 537824 | 3457440 | 8890560 | 11430720 | 7348320 | 1889568 | 33554432 | ||||
| 4 | 7529536 | 58084992 | 186701760 | 320060160 | 308629440 | 158723712 | 34012224 | 1073741824 | |||
| 5 | 105413504 | 948721536 | 3659354496 | 7841473920 | 10081895040 | 7777461888 | 3333197952 | 612220032 | 34359738368 | ||
| 6 | 1475789056 | 15179544576 | 68307950592 | 175649015808 | 282293061120 | 290358577152 | 186659085312 | 68568643584 | 11019960576 | 1099511627776 | |
| 7 | 20661046784 | 239077827072 | 1229543110656 | 3688629331968 | 7113785140224 | 9146295180288 | 7839681583104 | 4319824545792 | 1388515032576 | 198359290368 | 35184372088832 |
Computed in your browser ?
Technical details
- Node id
n-91e60f9c0a45aa60· revision 1 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-27210632b0078bca
Observed on the stored rows ?
- Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
- 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 ?
- A009976: 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: 196, 504, 324; 1: 2744, 10584, 13608, 5832; 2: 38416, 197568, 381024, 326592, 104976; 3: 537824, 3457440, 8890560, 11430720, 7348320, 1889568; 4: 7529536, 58084992, 186701760, 320060160, 308629440, 158723712, 34012224; 5: 105413504, 948721536, 3659354496, 7841473920, 10081895040, 7777461888, 3333197952, 612220032; 6: 1475789056, 15179544576, 68307950592, 175649015808, 282293061120, 290358577152, 186659085312, 68568643584, 11019960576; 7: 20661046784, 239077827072, 1229543110656, 3688629331968, 7113785140224, 9146295180288, 7839681583104, 4319824545792, 1388515032576, 198359290368; 8: 289254654976, 3718988421120, 21517004436480, 73772586639360, 165988319938560, 256096265048064, 274388855408640, 201591812136960, 97196052280320, 27770300651520, 3570467226624; 9: 4049565169664, 57272421685248, 368179853690880, 1420122292807680, 3651743038648320, 6573137469566976, 8451176746586112, 7761284767272960, 4989397350389760, 2138313150167040, 549851952900096, 64268410079232;
%F FormulaThe row polynomials satisfy P(n,x) = (14+18*x)*P(n-1,x) for n >= 1, with P(0,x) = 196 + 504*x + 324*x^2.
%t MathematicaP[0, x_] := 196 + 504*x + 324*x^2;
P[n_, x_] := P[n, x] = Expand[(14 + 18*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] = 196 + 504*x + 324*x^2; for(n = 1, N, my(i = n + 1); v[i] = (14 + 18*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-89b2e37c644537dd -
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-89b2e37c644537dd -
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-89b2e37c644537dd
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 A013610
e-89b2e37c644537ddGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*6^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-4ef268212a4f2f46root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-4fdd1b3030c1c25croot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*6^j.
Related sequences ?
Same fingerprint (2)
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