A038324: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*10^j.
A038324 nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · Hadamard kernel basis map preserves real roots what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 11 | 10 | 21 | |||||||||||||
| 2 | 121 | 220 | 100 | 441 | ||||||||||||
| 3 | 1331 | 3630 | 3300 | 1000 | 9261 | |||||||||||
| 4 | 14641 | 53240 | 72600 | 44000 | 10000 | 194481 | ||||||||||
| 5 | 161051 | 732050 | 1331000 | 1210000 | 550000 | 100000 | 4084101 | |||||||||
| 6 | 1771561 | 9663060 | 21961500 | 26620000 | 18150000 | 6600000 | 1000000 | 85766121 | ||||||||
| 7 | 19487171 | 124009270 | 338207100 | 512435000 | 465850000 | 254100000 | 77000000 | 10000000 | 1801088541 | |||||||
| 8 | 214358881 | 1558973680 | 4960370800 | 9018856000 | 10248700000 | 7453600000 | 3388000000 | 880000000 | 100000000 | 37822859361 | ||||||
| 9 | 2357947691 | 19292299290 | 70153815600 | 148811124000 | 202924260000 | 184476600000 | 111804000000 | 43560000000 | 9900000000 | 1000000000 | 794280046581 | |||||
| 10 | 25937424601 | 235794769100 | 964614964500 | 2338460520000 | 3720278100000 | 4058485200000 | 3074610000000 | 1597200000000 | 544500000000 | 110000000000 | 10000000000 | 16679880978201 | ||||
| 11 | 285311670611 | 2853116706110 | 12968712300500 | 35369215365000 | 64307664300000 | 81846118200000 | 74405562000000 | 48315300000000 | 21961500000000 | 6655000000000 | 1210000000000 | 100000000000 | 350277500542221 | |||
| 12 | 3138428376721 | 34237400473320 | 171187002366600 | 518748492020000 | 1061076460950000 | 1543383943200000 | 1636922364000000 | 1275523920000000 | 724729500000000 | 292820000000000 | 79860000000000 | 13200000000000 | 1000000000000 | 7355827511386641 | ||
| 13 | 34522712143931 | 407995688973730 | 2225431030765800 | 7418103435886000 | 16859325990650000 | 27587987984700000 | 33439985436000000 | 30399986760000000 | 20727263700000000 | 10468315000000000 | 3806660000000000 | 943800000000000 | 143000000000000 | 10000000000000 | 154472377739119461 | |
| 14 | 379749833583241 | 4833179700150340 | 28559698228161100 | 103853448102404000 | 259633620256010000 | 472061127738200000 | 643719719643000000 | 668799708720000000 | 531999768300000000 | 322424102000000000 | 146556410000000000 | 48448400000000000 | 11011000000000000 | 1540000000000000 | 100000000000000 | 3243919932521508681 |
Generated b-files: A009965 (row sums), A038313 (reversed triangle), A038324 ?
Computed in your browser ?
Technical details
- Node id
n-e1d1088f7d1ff894· revision 2 · JSON- Definition source
oeis_catalog:A038324- Fingerprint
f6-c4264000c5d1dd22
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 ?
- A009965: 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 ?
- A038324: triangle, 36 terms agree, 8 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A038313: reversed triangle, 31 terms agree, 7 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 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: 11, 10; 2: 121, 220, 100; 3: 1331, 3630, 3300, 1000; 4: 14641, 53240, 72600, 44000, 10000; 5: 161051, 732050, 1331000, 1210000, 550000, 100000; 6: 1771561, 9663060, 21961500, 26620000, 18150000, 6600000, 1000000; 7: 19487171, 124009270, 338207100, 512435000, 465850000, 254100000, 77000000, 10000000; 8: 214358881, 1558973680, 4960370800, 9018856000, 10248700000, 7453600000, 3388000000, 880000000, 100000000; 9: 2357947691, 19292299290, 70153815600, 148811124000, 202924260000, 184476600000, 111804000000, 43560000000, 9900000000, 1000000000;
%F FormulaThe row polynomials satisfy P(n,x) = (11+10*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[(11 + 10*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] = (11 + 10*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.
A038313: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 10, 11; 2: 100, 220, 121; 3: 1000, 3300, 3630, 1331; 4: 10000, 44000, 72600, 53240, 14641; 5: 100000, 550000, 1210000, 1331000, 732050, 161051; 6: 1000000, 6600000, 18150000, 26620000, 21961500, 9663060, 1771561; 7: 10000000, 77000000, 254100000, 465850000, 512435000, 338207100, 124009270, 19487171; 8: 100000000, 880000000, 3388000000, 7453600000, 10248700000, 9018856000, 4960370800, 1558973680, 214358881; 9: 1000000000, 9900000000, 43560000000, 111804000000, 184476600000, 202924260000, 148811124000, 70153815600, 19292299290, 2357947691;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (11+10*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[(11 + 10*x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {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] = (11 + 10*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)Generated with polytool c48629374597.
A038324: triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 11, 10; 2: 121, 220, 100; 3: 1331, 3630, 3300, 1000; 4: 14641, 53240, 72600, 44000, 10000; 5: 161051, 732050, 1331000, 1210000, 550000, 100000; 6: 1771561, 9663060, 21961500, 26620000, 18150000, 6600000, 1000000; 7: 19487171, 124009270, 338207100, 512435000, 465850000, 254100000, 77000000, 10000000; 8: 214358881, 1558973680, 4960370800, 9018856000, 10248700000, 7453600000, 3388000000, 880000000, 100000000; 9: 2357947691, 19292299290, 70153815600, 148811124000, 202924260000, 184476600000, 111804000000, 43560000000, 9900000000, 1000000000;
%F FormulaThe row polynomials satisfy P(n,x) = (11+10*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[(11 + 10*x)*P[n - 1, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = (11 + 10*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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-0ddfaa48a1d96c8a -
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-0ddfaa48a1d96c8a,e-0f31cc897fc45a50,e-96e2fb6c9c1a89f9 -
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-0ddfaa48a1d96c8a,e-0f31cc897fc45a50,e-96e2fb6c9c1a89f9 -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-0ddfaa48a1d96c8a -
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-0f31cc897fc45a50,e-96e2fb6c9c1a89f9 -
Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, +inf) to roots in (-inf, +inf): every real-rooted input has a real-rooted image (an affine substitution times g)
The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.by the cited steps:
e-cdb8a48ab65be945 -
Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 11] to roots in (-inf, 0]: an input root r <= 11 gives the root (r - a)/d <= 0; a larger root gives a positive root
The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.by the cited steps:
e-cdb8a48ab65be945
Proof chains
4 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 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.
-
basis_map_theorem
e-cdb8a48ab65be945root: theorem checkGeometric basis map (elementary) polytool ?
-
parent_provers periodic_product
e-96e2fb6c9c1a89f9root: theorem checkParent-row provers of polytool polytool ?
-
theorem_check liu_wang
e-0ddfaa48a1d96c8aroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
Used in 7 proof steps
e-25d25e50279a57dabasis_map (A013609) → basis_map_A013609 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-3706f9e3ae504ed3basis_map (A007318) → basis_map_A007318 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-6a3d937c421a3f39basis_map (A008277) → basis_map_A008277 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-90d6f2d342e10179basis_map (A013610) → basis_map_A013610 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-bf7e65720bb019ebbasis_map (A013611) → basis_map_A013611 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-4af761c482728828obreschkoff_combination → obreschkoff_combination of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11…e-4af761c482728828obreschkoff_combination → obreschkoff_combination of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11…
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