A154986 → basis A013611
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 | 4 | 6 | |||||||||||||
| 2 | 6 | 24 | 16 | 46 | ||||||||||||
| 3 | 24 | 144 | 224 | 64 | 456 | |||||||||||
| 4 | 120 | 960 | 2368 | 1792 | 256 | 5496 | ||||||||||
| 5 | 720 | 7200 | 24576 | 32256 | 12800 | 1024 | 78576 | |||||||||
| 6 | 5040 | 60480 | 264192 | 500736 | 377344 | 83968 | 4096 | 1295856 | ||||||||
| 7 | 40320 | 564480 | 3012096 | 7541760 | 8714240 | 3870720 | 516096 | 16384 | 24276096 | |||||||
| 8 | 362880 | 5806080 | 36624384 | 114352128 | 180891648 | 131825664 | 35553280 | 3014656 | 65536 | 508496256 | ||||||
| 9 | 3628800 | 65318400 | 475914240 | 1785692160 | 3618643968 | 3775610880 | 1750335488 | 298057728 | 16908288 | 262144 | 11790372096 | |||||
| 10 | 39916800 | 798336000 | 6599485440 | 28951511040 | 71827070976 | 99011100672 | 69260148736 | 20667957248 | 2317221888 | 91750400 | 1048576 | 299565547776 | ||||
| 11 | 479001600 | 10538035200 | 97482977280 | 490129367040 | 1443215572992 | 2492851027968 | 2388370391040 | 1121310474240 | 220311584768 | 16920870912 | 484442112 | 4194304 | 8282097939456 | |||
| 12 | 6227020800 | 149448499200 | 1529771581440 | 8676318412800 | 29614519812096 | 61752723111936 | 76168345681920 | 51093631401984 | 16144419782656 | 2150692290560 | 117234991104 | 2499805184 | 16777216 | 247405849168896 | ||
| 13 | 87178291200 | 2266635571200 | 25440415580160 | 160761282232320 | 624916667695104 | 1531414803382272 | 2327472406265856 | 2072128203522048 | 970729708322816 | 208993148469248 | 19471435563008 | 776885764096 | 12650020864 | 67108864 | 7944471487789056 | |
| 14 | 1307674368000 | 36614882304000 | 447164308684800 | 3116047889203200 | 13599080874639360 | 38360862307123200 | 69599225365659648 | 78203742603706368 | 50364420291821568 | 16445468728885248 | 2461956220911616 | 165241551847424 | 4955754725376 | 62948114432 | 268435456 | 272806151670429696 |
Computed in your browser ?
Technical details
- Node id
n-a435593930610061· revision 1 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-0c8653d5993ee612
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 ℚ): 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, 4; 2: 6, 24, 16; 3: 24, 144, 224, 64; 4: 120, 960, 2368, 1792, 256; 5: 720, 7200, 24576, 32256, 12800, 1024; 6: 5040, 60480, 264192, 500736, 377344, 83968, 4096; 7: 40320, 564480, 3012096, 7541760, 8714240, 3870720, 516096, 16384; 8: 362880, 5806080, 36624384, 114352128, 180891648, 131825664, 35553280, 3014656, 65536; 9: 3628800, 65318400, 475914240, 1785692160, 3618643968, 3775610880, 1750335488, 298057728, 16908288, 262144;
%F FormulaThe row polynomials satisfy P(n,x) = (n^2-n+(4*n^2-4*n)*x)*P(n-2,x) + (2+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[(n^2 - n + (4*n^2 - 4*n)*x)*P[n - 2, x] + (2 + 4*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; v[2] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (n^2 - n + (4*n^2 - 4*n)*x)*v[i - 2] + (2 + 4*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-14af6f76e3a2317a -
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-14af6f76e3a2317a -
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-14af6f76e3a2317a -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-14af6f76e3a2317a
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 A013611
e-14af6f76e3a2317aGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang_derivative_lag
e-bad4de7d401fa939root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-3d59ef840ca39edfAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows.
-
-
premise (sequence):
Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows.
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