A113413 → basis A013610

OEIS matches ?

• A126501: 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:    3,     3;
  2:    7,    18,      9;
  3:   17,    69,     81,     27;
  4:   41,   228,    432,    324,      81;
  5:   99,   699,   1836,   2214,    1215,     243;
  6:  239,  2046,   6885,  11556,   10125,    4374,     729;
  7:  577,  5805,  23841,  51489,   62775,   43011,   15309,   2187;
  8: 1393, 16104,  78120, 206712,  324810,  309096,  173502,  52488,   6561;
  9: 3363, 43923, 245808, 770796, 1486998, 1823958, 1418634, 673596, 177147, 19683;

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

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

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 A013610 e-3d8a64e4b99d997d

  Geometric basis map (elementary) polytool ?

  • premise (sequence): A Riordan array of coordination sequences.
    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-7fe1799d89540b32 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