A257616: 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) = 6*x + 2.

A257616 palindromic γ-positive nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence from OEIS A257616
\(P_{n}(x) = \left(2 - 4\,x + 6\,n x\right)\,P_{n-1}(x) + \left(6\,x - 6\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
2432440
383123128640
4162656873626561614080
532216641754241754242166432394240
6641743363019200701696030192001743366413404160
7128139712047847552218838400218838400478475521397120128536166400
82561118259272295628859078896641137959680059078896647229562881118259225624663654400
9512894735361061342208014563013222448492198604848492198604814563013222410613422080894735365121282510028800
10102471581696015306158592033795932160001814191666176031035007107072181419166617603379593216000153061585920715816960102474385581670400
112048572659916821829479526407524494361600062039193470976016825130605731841682513060573184620391934709760752449436160002182947952640572659916820484760677226905600
1240964581293260830916320485376162714395766784019892437483253760811376630655713281278709926035619848113766306557132819892437483253760162714395766784030916320485376458129326084096333247405883392000
13819236650376396843594376621260834459691023450112608323436193996800359102709226097049684291548938204938248429154893820493824359102709226097049660832343619399680034459691023450112435943766212608366503763968819225326802847137792000
141638429320307671046130334005510144718837996571459584179529101844978237441489789793792148766724998592405782272901127417656306562034565124998592405782272901121489789793792148766721795291018449782374471883799657145958461303340055101442932030767104163842076797833465298944000

Generated b-files: A049308 (row sums), A257616, A257616 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-c060a08f0b5770ad · revision 1 · JSON
Definition source
oeis_catalog:A257616
Fingerprint
f6-257640823bee26bf

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 ?

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 Example
Triangle begins:
  0:   1;
  1:   2,        2;
  2:   4,       32,           4;
  3:   8,      312,         312,            8;
  4:  16,     2656,        8736,         2656,           16;
  5:  32,    21664,      175424,       175424,        21664,           32;
  6:  64,   174336,     3019200,      7016960,      3019200,       174336,           64;
  7: 128,  1397120,    47847552,    218838400,    218838400,     47847552,      1397120,         128;
  8: 256, 11182592,   722956288,   5907889664,  11379596800,   5907889664,    722956288,    11182592,      256;
  9: 512, 89473536, 10613422080, 145630132224, 484921986048, 484921986048, 145630132224, 10613422080, 89473536, 512;
%F Formula
The row polynomials satisfy P(n,x) = (2+(6*n-4)*x)*P(n-1,x) + (6*x-6*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + (6*n - 4)*x)*P[n - 1, x] + (6*x - 6*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + (6*n - 4)*x)*v[i - 1] + (6*x - 6*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.

A257616: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:   1;
  1:   2,        2;
  2:   4,       32,           4;
  3:   8,      312,         312,            8;
  4:  16,     2656,        8736,         2656,           16;
  5:  32,    21664,      175424,       175424,        21664,           32;
  6:  64,   174336,     3019200,      7016960,      3019200,       174336,           64;
  7: 128,  1397120,    47847552,    218838400,    218838400,     47847552,      1397120,         128;
  8: 256, 11182592,   722956288,   5907889664,  11379596800,   5907889664,    722956288,    11182592,      256;
  9: 512, 89473536, 10613422080, 145630132224, 484921986048, 484921986048, 145630132224, 10613422080, 89473536, 512;
%F Formula
The row polynomials satisfy P(n,x) = (2+(6*n-4)*x)*P(n-1,x) + (6*x-6*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + (6*n - 4)*x)*P[n - 1, x] + (6*x - 6*x^2)*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + (6*n - 4)*x)*v[i - 1] + (6*x - 6*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.

A257616: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:   1;
  1:   2,        2;
  2:   4,       32,           4;
  3:   8,      312,         312,            8;
  4:  16,     2656,        8736,         2656,           16;
  5:  32,    21664,      175424,       175424,        21664,           32;
  6:  64,   174336,     3019200,      7016960,      3019200,       174336,           64;
  7: 128,  1397120,    47847552,    218838400,    218838400,     47847552,      1397120,         128;
  8: 256, 11182592,   722956288,   5907889664,  11379596800,   5907889664,    722956288,    11182592,      256;
  9: 512, 89473536, 10613422080, 145630132224, 484921986048, 484921986048, 145630132224, 10613422080, 89473536, 512;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (2+(6*n-4)*x)*P(n-1,x) + (6*x-6*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + (6*n - 4)*x)*P[n - 1, x] + (6*x - 6*x^2)*D[P[n - 1, x], x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + (6*n - 4)*x)*v[i - 1] + (6*x - 6*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-d30c56e449c0455e
  • 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-d30c56e449c0455e
  • 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-d30c56e449c0455e
  • 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-d30c56e449c0455e

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

Used in 3 proof steps

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

References

  1. [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