A257614 → γ
nonnegative coefficients
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 | 2 | 2 | |||||||
| 2 | 4 | 20 | 24 | ||||||
| 3 | 8 | 220 | 228 | ||||||
| 4 | 16 | 1780 | 2200 | 3996 | |||||
| 5 | 32 | 13100 | 62000 | 75132 | |||||
| 6 | 64 | 93300 | 1137000 | 620000 | 1850364 | ||||
| 7 | 128 | 656940 | 17376000 | 33280000 | 51313068 | ||||
| 8 | 256 | 4607540 | 241359000 | 1087040000 | 332800000 | 1665806796 | |||
| 9 | 512 | 32273260 | 3172760400 | 28134040000 | 29062400000 | 60401474172 | |||
| 10 | 1024 | 225958900 | 40332253000 | 636916700000 | 1483394000000 | 290624000000 | 2451492912924 | ||
| 11 | 2048 | 1581814700 | 502063748000 | 13247519080000 | 58111336000000 | 37514728000000 | 109377228644748 | ||
| 12 | 4096 | 11072928180 | 6167128299000 | 260352286720000 | 1940825346000000 | 2756237736000000 | 375147280000000 | 5338740849951276 | |
| 13 | 8192 | 77510988780 | 75112832406000 | 4919359138160000 | 58319294815200000 | 152051432712000000 | 67129467680000000 | 282494744688762972 | |
| 14 | 16384 | 542577986420 | 909880197637800 | 90389260265260000 | 1627379625605600000 | 7021353423984000000 | 6709685947120000000 | 671294676800000000 | 16121013356550500604 |
Computed in your browser ?
Technical details
- Node id
n-03d4f0c316134406· revision 1 · JSON- Definition source
derived:gamma_polynomial- Fingerprint
f6-bb44a1e208d0448a
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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 ℚ): no
OEIS matches ?
No OEIS matches.
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: 4, 20; 3: 8, 220; 4: 16, 1780, 2200; 5: 32, 13100, 62000; 6: 64, 93300, 1137000, 620000; 7: 128, 656940, 17376000, 33280000; 8: 256, 4607540, 241359000, 1087040000, 332800000; 9: 512, 32273260, 3172760400, 28134040000, 29062400000;
%F FormulaThe row polynomials satisfy P(n,x) = (2+(10*n-10)*x)*P(n-1,x) + (5*x-20*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 + (10*n - 10)*x)*P[n - 1, x] + (5*x - 20*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 + (10*n - 10)*x)*v[i - 1] + (5*x - 20*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.
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-9458cf74e817fa3d -
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-9458cf74e817fa3d -
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-9458cf74e817fa3d
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
-
gamma_polynomial scale 1, shift 0
e-9458cf74e817fa3dGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m)…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-73c74b4a6ca9fddaroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
-
premise (sequence):
Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m)…
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