A161198 → basis A013609

OEIS matches ?

• A051579: 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:
   1:         1;
   2:         3,          4;
   3:        15,         32,         16;
   4:       105,        284,        240,         64;
   5:       945,       2976,       3296,       1536,        256;
   6:     10395,      36516,      48160,      30080,       8960,       1024;
   7:    135135,     516288,     772144,     583680,     236800,      49152,      4096;
   8:   2027025,    8284860,   13647312,   11843776,    5886720,    1684480,    258048,    16384;
   9:  34459425,  148950720,  265143744,  255933440,  147449344,   52183040,  11124736,  1310720,   65536;
  10: 654729075, 2967901380, 5633534016, 5923310336, 3825271296, 1581275136, 420102144, 69402624, 6488064, 262144;

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

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2*n - 1 + 4*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (2*n - 1 + 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, v[i])))};
T(10)

Proved properties

• Real-rooted. Every row P_n, n >= 1, 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-5c9ad73da84eb2a7
• Coefficients of one sign. Every nonzero row, n >= 1: 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-5c9ad73da84eb2a7
• Hadamard kernel (Malo). Rows P_n, n >= 1, 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-5c9ad73da84eb2a7

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 A013609 e-5c9ad73da84eb2a7

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle of polynomial coefficients related to the series expansions of (1-x)^((-1-2*n)/2).
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-6c4d7be2cbbf8954 root: theorem check

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

    • parent_provers root_domain e-84f434121cdb02d1 root: theorem check

      Parent-row provers of polytool polytool ?

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