A154228 → basis A013611

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.

Triangle begins:
  0:          1;
  1:          2,           4;
  2:         18,          72,           16;
  3:         96,         576,          800,           64;
  4:       1182,        9456,        20624,         6848,          256;
  5:      11100,      111000,       361536,       393216,        51200,         1024;
  6:     187680,     2252160,      9349792,     14740736,      5545984,       350208,         4096;
  7:    2639760,    36956640,    192037568,    442110080,    401363968,     64872448,      2244608,      16384;
  8:   58768320,   940293120,   5764054816,  16512243072,  20956212736,   8157431808,    664383488,   13680640,    65536;
  9: 1133844240, 20409196320, 146136971392, 522030940928, 943336048640, 743216117760, 134726238208, 6147899392, 80084992, 262144;

The row polynomials satisfy P(n,x) = ((1/3)*n^3+(3/2)*n^2+(13/6)*n+1+((4/3)*n^3+6*n^2+(26/3)*n+4)*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.

P[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[((1/3)*n^3 + (3/2)*n^2 + (13/6)*n + 1 + ((4/3)*n^3 + 6*n^2 + (26/3)*n + 4)*x)*P[n - 2, x] + (2 + 4*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = ((1/3)*n^3 + (3/2)*n^2 + (13/6)*n + 1 + ((4/3)*n^3 + 6*n^2 + (26/3)*n + 4)*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)

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-1820edefae4adbcf
• 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-1820edefae4adbcf
• 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-1820edefae4adbcf
• 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-1820edefae4adbcf

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-1820edefae4adbcf

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)*(2*n+3)/6)*T(n-2, k-1), 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-a3c76982c9b6ad3f root: theorem check

      Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?

Related sequences ?

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