A038324 → basis A013609
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 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 21 | 20 | 41 | ||||||
| 2 | 441 | 840 | 400 | 1681 | |||||
| 3 | 9261 | 26460 | 25200 | 8000 | 68921 | ||||
| 4 | 194481 | 740880 | 1058400 | 672000 | 160000 | 2825761 | |||
| 5 | 4084101 | 19448100 | 37044000 | 35280000 | 16800000 | 3200000 | 115856201 | ||
| 6 | 85766121 | 490092120 | 1166886000 | 1481760000 | 1058400000 | 403200000 | 64000000 | 4750104241 | |
| 7 | 1801088541 | 12007256940 | 34306448400 | 54454680000 | 51861600000 | 29635200000 | 9408000000 | 1280000000 | 194754273881 |
Generated b-files: A009985 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-fbf962df53148c52· revision 1 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-640a8dc8403e6c62
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 ?
- A009985: 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: 1; 1: 21, 20; 2: 441, 840, 400; 3: 9261, 26460, 25200, 8000; 4: 194481, 740880, 1058400, 672000, 160000; 5: 4084101, 19448100, 37044000, 35280000, 16800000, 3200000; 6: 85766121, 490092120, 1166886000, 1481760000, 1058400000, 403200000, 64000000; 7: 1801088541, 12007256940, 34306448400, 54454680000, 51861600000, 29635200000, 9408000000, 1280000000; 8: 37822859361, 288174166560, 960580555200, 1829677248000, 2178187200000, 1659571200000, 790272000000, 215040000000, 25600000000; 9: 794280046581, 6808114684980, 25935674990400, 57634833312000, 82335476160000, 78414739200000, 49787136000000, 20321280000000, 4838400000000, 512000000000;
%F FormulaThe row polynomials satisfy P(n,x) = (21+20*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(21 + 20*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (21 + 20*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-25d25e50279a57da -
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-25d25e50279a57da -
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-25d25e50279a57da
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 A013609
e-25d25e50279a57daGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*10^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-0ddfaa48a1d96c8aroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A013609
e-0f31cc897fc45a50Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*5^j.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-0a7984b7b9125974root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-7949976749bfedcfroot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*5^j.
-
parent_provers periodic_product
e-96e2fb6c9c1a89f9root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*10^j.
Related sequences ?
No candidate equalities or related sequences.
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