A257611: Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1) and f(n) = 2*n + 3.

A257611 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 A257611
\(P_{n}(x) = \left(3 + x + 2\,n x\right)\,P_{n-1}(x) + \left(2\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1336
2930948
32721321327480
481130829821308815760
524374313264632646743124380640
672940314310263587628310263403147291290240
721872125052695923870154587015452695923212505218723224320
865611099704220590361133609041914339901133609042205903610997046561464486400
9196835623179173108220135113367635794656423579465642135113367617310822056231791968310218700800
1059049285292381318597941151030428245964112720293066106692596411272021510304282413185979412852923859049245248819200
1117714714400431798292995851609807462959128041272302104476295026210447629502691280412723016098074629598292995851440043171771476376469299200
125314417244502607211719638616552420079401309947957913542875861998248631342888507804287586199824813099479579135165524200794072117196386724450260531441178541140377600
1315943233636600207522931631202165558735883381788543575372258062763179807891675903986731916167590398673191680627631798078917885435753722516555873588338522931631202363660020715943235356234211328000
1447829691822923640237587096240031620761530750922348183025441249142375336420319824045780984261373156980735548885144404578098426137311423753364203198223481830254412491620761530750923758709624003182292364024782969171399494762496000

Generated b-files: A051578 (row sums), A257611, A257611 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-0c0e99d973615582 · revision 1 · JSON
Definition source
oeis_catalog:A257611
Fingerprint
f6-b446d021db3cc66d

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:     3,       3;
  2:     9,      30,         9;
  3:    27,     213,       213,         27;
  4:    81,    1308,      2982,       1308,         81;
  5:   243,    7431,     32646,      32646,       7431,        243;
  6:   729,   40314,    310263,     587628,     310263,      40314,        729;
  7:  2187,  212505,   2695923,    8701545,    8701545,    2695923,     212505,      2187;
  8:  6561, 1099704,  22059036,  113360904,  191433990,  113360904,   22059036,   1099704,    6561;
  9: 19683, 5623179, 173108220, 1351133676, 3579465642, 3579465642, 1351133676, 173108220, 5623179, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (3+(2*n+1)*x)*P(n-1,x) + (2*x-2*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[(3 + (2*n + 1)*x)*P[n - 1, x] + (2*x - 2*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] = (3 + (2*n + 1)*x)*v[i - 1] + (2*x - 2*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.

A257611: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:     1;
  1:     3,       3;
  2:     9,      30,         9;
  3:    27,     213,       213,         27;
  4:    81,    1308,      2982,       1308,         81;
  5:   243,    7431,     32646,      32646,       7431,        243;
  6:   729,   40314,    310263,     587628,     310263,      40314,        729;
  7:  2187,  212505,   2695923,    8701545,    8701545,    2695923,     212505,      2187;
  8:  6561, 1099704,  22059036,  113360904,  191433990,  113360904,   22059036,   1099704,    6561;
  9: 19683, 5623179, 173108220, 1351133676, 3579465642, 3579465642, 1351133676, 173108220, 5623179, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (3+(2*n+1)*x)*P(n-1,x) + (2*x-2*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[(3 + (2*n + 1)*x)*P[n - 1, x] + (2*x - 2*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] = (3 + (2*n + 1)*x)*v[i - 1] + (2*x - 2*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.

A257611: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:     1;
  1:     3,       3;
  2:     9,      30,         9;
  3:    27,     213,       213,         27;
  4:    81,    1308,      2982,       1308,         81;
  5:   243,    7431,     32646,      32646,       7431,        243;
  6:   729,   40314,    310263,     587628,     310263,      40314,        729;
  7:  2187,  212505,   2695923,    8701545,    8701545,    2695923,     212505,      2187;
  8:  6561, 1099704,  22059036,  113360904,  191433990,  113360904,   22059036,   1099704,    6561;
  9: 19683, 5623179, 173108220, 1351133676, 3579465642, 3579465642, 1351133676, 173108220, 5623179, 19683;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (3+(2*n+1)*x)*P(n-1,x) + (2*x-2*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[(3 + (2*n + 1)*x)*P[n - 1, x] + (2*x - 2*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] = (3 + (2*n + 1)*x)*v[i - 1] + (2*x - 2*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-4c1dd88e7fbb8285
  • 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-4c1dd88e7fbb8285
  • 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-4c1dd88e7fbb8285
  • 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-4c1dd88e7fbb8285

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

No candidate equalities or related sequences.

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