A257619: Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 2.
A257619 palindromic γ-positive nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · 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 | 2 | 2 | 4 | |||||||||||||
| 2 | 4 | 44 | 4 | 52 | ||||||||||||
| 3 | 8 | 564 | 564 | 8 | 1144 | |||||||||||
| 4 | 16 | 6436 | 22560 | 6436 | 16 | 35464 | ||||||||||
| 5 | 32 | 71404 | 637844 | 637844 | 71404 | 32 | 1418560 | |||||||||
| 6 | 64 | 786948 | 15470232 | 36994952 | 15470232 | 786948 | 64 | 69509440 | ||||||||
| 7 | 128 | 8660012 | 346391196 | 1660722424 | 1660722424 | 346391196 | 8660012 | 128 | 4031547520 | |||||||
| 8 | 256 | 95268452 | 7412784592 | 64441336508 | 126214904224 | 64441336508 | 7412784592 | 95268452 | 256 | 270113683840 | ||||||
| 9 | 512 | 1047971916 | 154448141220 | 2283914695884 | 7824909176388 | 7824909176388 | 2283914695884 | 154448141220 | 1047971916 | 512 | 20528639971840 | |||||
| 10 | 1024 | 11527733572 | 3166512746184 | 76272655359936 | 425245771672248 | 735541462580472 | 425245771672248 | 76272655359936 | 3166512746184 | 11527733572 | 1024 | 1744934397606400 | ||||
| 11 | 2048 | 126805163500 | 64287056810156 | 2446228948655760 | 21117061921941264 | 58384211954928072 | 58384211954928072 | 21117061921941264 | 2446228948655760 | 64287056810156 | 126805163500 | 2048 | 164023833375001600 | |||
| 12 | 4096 | 1394857005348 | 1297407211245120 | 76276465226259988 | 983469295234294272 | 4116666986807801544 | 6539031738951944064 | 4116666986807801544 | 983469295234294272 | 76276465226259988 | 1297407211245120 | 1394857005348 | 4096 | 16894454837625164800 | ||
| 13 | 8192 | 15343427509388 | 26089024782442548 | 2331378954996090692 | 43702779832682761340 | 266260076227304448696 | 633769131523815967944 | 633769131523815967944 | 266260076227304448696 | 43702779832682761340 | 2331378954996090692 | 26089024782442548 | 15343427509388 | 8192 | 1892178941814018457600 | |
| 14 | 16384 | 168777703578116 | 523468272674883640 | 70244981197913327416 | 1875192497501585274584 | 16141554308795978279932 | 55194317006154223408368 | 82389987098096075832720 | 55194317006154223408368 | 16141554308795978279932 | 1875192497501585274584 | 70244981197913327416 | 523468272674883640 | 168777703578116 | 16384 | 228953651959496233369600 |
Generated b-files: A144829 (row sums), A257619, A257619 (reversed triangle) ?
Computed in your browser ?
Technical details
- Node id
n-6a6e9e081117dc37· revision 1 · JSON- Definition source
oeis_catalog:A257619- Fingerprint
f6-1b04ca4a6cf48070
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: yes
- γ-positive (gamma_positive): yes
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
OEIS matches ?
- A257619: reversed 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 ?
- A257619: 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 ?
- A144829: 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: 2, 2; 2: 4, 44, 4; 3: 8, 564, 564, 8; 4: 16, 6436, 22560, 6436, 16; 5: 32, 71404, 637844, 637844, 71404, 32; 6: 64, 786948, 15470232, 36994952, 15470232, 786948, 64; 7: 128, 8660012, 346391196, 1660722424, 1660722424, 346391196, 8660012, 128; 8: 256, 95268452, 7412784592, 64441336508, 126214904224, 64441336508, 7412784592, 95268452, 256; 9: 512, 1047971916, 154448141220, 2283914695884, 7824909176388, 7824909176388, 2283914695884, 154448141220, 1047971916, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (2+(9*n-7)*x)*P(n-1,x) + (9*x-9*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + (9*n - 7)*x)*P[n - 1, x] + (9*x - 9*x^2)*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + (9*n - 7)*x)*v[i - 1] + (9*x - 9*x^2)*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.
A257619: triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 2, 2; 2: 4, 44, 4; 3: 8, 564, 564, 8; 4: 16, 6436, 22560, 6436, 16; 5: 32, 71404, 637844, 637844, 71404, 32; 6: 64, 786948, 15470232, 36994952, 15470232, 786948, 64; 7: 128, 8660012, 346391196, 1660722424, 1660722424, 346391196, 8660012, 128; 8: 256, 95268452, 7412784592, 64441336508, 126214904224, 64441336508, 7412784592, 95268452, 256; 9: 512, 1047971916, 154448141220, 2283914695884, 7824909176388, 7824909176388, 2283914695884, 154448141220, 1047971916, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (2+(9*n-7)*x)*P(n-1,x) + (9*x-9*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + (9*n - 7)*x)*P[n - 1, x] + (9*x - 9*x^2)*D[P[n - 1, x], 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] = (2 + (9*n - 7)*x)*v[i - 1] + (9*x - 9*x^2)*deriv(v[i - 1], x)); 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.
A257619: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 2, 2; 2: 4, 44, 4; 3: 8, 564, 564, 8; 4: 16, 6436, 22560, 6436, 16; 5: 32, 71404, 637844, 637844, 71404, 32; 6: 64, 786948, 15470232, 36994952, 15470232, 786948, 64; 7: 128, 8660012, 346391196, 1660722424, 1660722424, 346391196, 8660012, 128; 8: 256, 95268452, 7412784592, 64441336508, 126214904224, 64441336508, 7412784592, 95268452, 256; 9: 512, 1047971916, 154448141220, 2283914695884, 7824909176388, 7824909176388, 2283914695884, 154448141220, 1047971916, 512;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (2+(9*n-7)*x)*P(n-1,x) + (9*x-9*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + (9*n - 7)*x)*P[n - 1, x] + (9*x - 9*x^2)*D[P[n - 1, x], 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] = (2 + (9*n - 7)*x)*v[i - 1] + (9*x - 9*x^2)*deriv(v[i - 1], x)); 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-56de0822e00a89e3 -
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-56de0822e00a89e3 -
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-56de0822e00a89e3 -
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-56de0822e00a89e3
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
-
theorem_check liu_wang
e-56de0822e00a89e3root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
Used in 3 proof steps
e-a38dbd3442ab05b8gamma_polynomial (scale 1, shift 0) → gamma_polynomial of Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f…e-438bbc5de73b4ca9obreschkoff_combination → obreschkoff_combination of Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1…e-438bbc5de73b4ca9obreschkoff_combination → obreschkoff_combination of Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1…
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