A028338 → basis A013611

OEIS matches ?

• A052587: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A051578: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?

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.

Triangle begins:
  0:         1;
  1:         2,          4;
  2:         8,         24,         16;
  3:        48,        176,        192,         64;
  4:       384,       1600,       2240,       1280,        256;
  5:      3840,      17536,      28800,      21760,       7680,       1024;
  6:     46080,     225792,     415744,     376320,     179200,      43008,      4096;
  7:    645120,    3345408,    6723584,    6931456,    4014080,    1318912,    229376,    16384;
  8:  10321920,   56107008,  120958976,  137797632,   91951104,   37158912,   8945664,  1179648,   65536;
  9: 185794560, 1051213824, 2401689600, 2964193280, 2206310400, 1036664832, 309657600, 57016320, 5898240, 262144;

The row polynomials satisfy P(n,x) = (2*n+4*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2*n + 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; for(n = 1, N, my(i = n + 1); v[i] = (2*n + 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-38e97daa1f393e3a
• 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-38e97daa1f393e3a
• 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-38e97daa1f393e3a

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-38e97daa1f393e3a

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-59b849691f316c6f root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

    • parent_provers root_domain e-ef36674c01230a86 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

Same fingerprint (3)

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

• A137320: Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1…
• A137320 → reverse
• A132393 → basis A013609

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