A013613 → 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 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 7 | 12 | 19 | |||||||||||||
| 2 | 49 | 168 | 144 | 361 | ||||||||||||
| 3 | 343 | 1764 | 3024 | 1728 | 6859 | |||||||||||
| 4 | 2401 | 16464 | 42336 | 48384 | 20736 | 130321 | ||||||||||
| 5 | 16807 | 144060 | 493920 | 846720 | 725760 | 248832 | 2476099 | |||||||||
| 6 | 117649 | 1210104 | 5186160 | 11854080 | 15240960 | 10450944 | 2985984 | 47045881 | ||||||||
| 7 | 823543 | 9882516 | 50824368 | 145212480 | 248935680 | 256048128 | 146313216 | 35831808 | 893871739 | |||||||
| 8 | 5764801 | 79060128 | 474360768 | 1626379776 | 3485099520 | 4779565056 | 4096770048 | 2006581248 | 429981696 | 16983563041 | ||||||
| 9 | 40353607 | 622598508 | 4269246912 | 17076987648 | 43912253952 | 75278149632 | 86032171008 | 63207309312 | 27088846848 | 5159780352 | 322687697779 | |||||
| 10 | 282475249 | 4842432840 | 37355910480 | 170769876480 | 512309629440 | 1053894094848 | 1505562992640 | 1474837217280 | 948109639680 | 361184624640 | 61917364224 | 6131066257801 | ||||
| 11 | 1977326743 | 37286732868 | 319600567440 | 1643660061120 | 5635405923840 | 13524974217216 | 23185670086656 | 28390616432640 | 24334814085120 | 13905608048640 | 4767637045248 | 743008370688 | 116490258898219 | |||
| 12 | 13841287201 | 284735050992 | 2684644766496 | 15340827237120 | 59171762200320 | 162299690606592 | 324599381213184 | 476962356068352 | 511031095787520 | 389357025361920 | 200240755900416 | 62412703137792 | 8916100448256 | 2213314919066161 | ||
| 13 | 96889010407 | 2159240803356 | 22209333977376 | 139601527857792 | 598292262247680 | 1846158980649984 | 4219791955771392 | 7233929067036672 | 9300765943332864 | 8857872326983680 | 6073969595645952 | 2839777992769536 | 811365140791296 | 106993205379072 | 42052983462257059 | |
| 14 | 678223072849 | 16277353748376 | 181376227481904 | 1243722702733056 | 5863264170027264 | 20102620011522048 | 51692451458199552 | 101275006938513408 | 151912510407770112 | 173614297608880128 | 148812255093325824 | 92766081097138176 | 39756891898773504 | 10485334127149056 | 1283918464548864 | 799006685782884121 |
Generated b-files: A001029 (row sums), A038278, A038333 (reversed triangle) ?
Computed in your browser ?
Technical details
- Node id
n-96d5ef3a0d05e14f· revision 1 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-48a0cbb267bcb941
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 ?
- A038278: triangle, 32 terms agree, 7 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A038333: reversed triangle, 32 terms agree, 7 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A001029: 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: 7, 12; 2: 49, 168, 144; 3: 343, 1764, 3024, 1728; 4: 2401, 16464, 42336, 48384, 20736; 5: 16807, 144060, 493920, 846720, 725760, 248832; 6: 117649, 1210104, 5186160, 11854080, 15240960, 10450944, 2985984; 7: 823543, 9882516, 50824368, 145212480, 248935680, 256048128, 146313216, 35831808; 8: 5764801, 79060128, 474360768, 1626379776, 3485099520, 4779565056, 4096770048, 2006581248, 429981696; 9: 40353607, 622598508, 4269246912, 17076987648, 43912253952, 75278149632, 86032171008, 63207309312, 27088846848, 5159780352;
%F FormulaThe row polynomials satisfy P(n,x) = (7+12*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[(7 + 12*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] = (7 + 12*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.
A038278: triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 7, 12; 2: 49, 168, 144; 3: 343, 1764, 3024, 1728; 4: 2401, 16464, 42336, 48384, 20736; 5: 16807, 144060, 493920, 846720, 725760, 248832; 6: 117649, 1210104, 5186160, 11854080, 15240960, 10450944, 2985984; 7: 823543, 9882516, 50824368, 145212480, 248935680, 256048128, 146313216, 35831808; 8: 5764801, 79060128, 474360768, 1626379776, 3485099520, 4779565056, 4096770048, 2006581248, 429981696; 9: 40353607, 622598508, 4269246912, 17076987648, 43912253952, 75278149632, 86032171008, 63207309312, 27088846848, 5159780352;
%F FormulaThe row polynomials satisfy P(n,x) = (7+12*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[(7 + 12*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] = (7 + 12*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.
A038333: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 12, 7; 2: 144, 168, 49; 3: 1728, 3024, 1764, 343; 4: 20736, 48384, 42336, 16464, 2401; 5: 248832, 725760, 846720, 493920, 144060, 16807; 6: 2985984, 10450944, 15240960, 11854080, 5186160, 1210104, 117649; 7: 35831808, 146313216, 256048128, 248935680, 145212480, 50824368, 9882516, 823543; 8: 429981696, 2006581248, 4096770048, 4779565056, 3485099520, 1626379776, 474360768, 79060128, 5764801; 9: 5159780352, 27088846848, 63207309312, 86032171008, 75278149632, 43912253952, 17076987648, 4269246912, 622598508, 40353607;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (7+12*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[(7 + 12*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] = (7 + 12*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.
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-64a82ef46e481e9c -
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-64a82ef46e481e9c -
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-64a82ef46e481e9c
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-64a82ef46e481e9cGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+6x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-1784cac1b85d5f84root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers periodic_product
e-5658c7be1cbffd3froot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+6x)^n.
Related sequences ?
Same fingerprint (3)
Equal up to content, sign, reversal and a small index shift.
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*7^j.
- A038284 → basis A013611
- A038335 → basis A013611
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