A113413 → basis A013611

OEIS matches ?

• A126528: 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,     4;
  2:    7,    24,     16;
  3:   17,    92,    144,      64;
  4:   41,   304,    768,     768,     256;
  5:   99,   932,   3264,    5248,    3840,    1024;
  6:  239,  2728,  12240,   27392,   32000,   18432,    4096;
  7:  577,  7740,  42384,  122048,  198400,  181248,   86016,   16384;
  8: 1393, 21472, 138880,  489984, 1026560, 1302528,  974848,  393216,   65536;
  9: 3363, 58564, 436992, 1827072, 4699648, 7686144, 7970816, 5046272, 1769472, 262144;

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

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

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-14cc72d2ba3c3aa2

  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