A102662 → basis A013610

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:    4,     9;
  2:    9,    33,     27;
  3:   22,   114,    180,      81;
  4:   53,   354,    828,     783,     243;
  5:  128,  1047,   3240,    4671,    3078,     729;
  6:  309,  2991,  11511,   22329,   22761,   11421,    2187;
  7:  746,  8340,  38376,   93582,  129600,  101088,   40824,    6561;
  8: 1801, 22836, 122256,  359154,  629694,  670680,  421362,  142155,  19683;
  9: 4348, 61653, 376416, 1293786, 2747196, 3720330, 3198852, 1677429, 485514, 59049;

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) = 4 + 9*x.

P[0, x_] := 1;
P[1, x_] := 4 + 9*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] = 4 + 9*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-06cbef974e179f0a
• 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-06cbef974e179f0a
• 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-06cbef974e179f0a
• 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-06cbef974e179f0a

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-06cbef974e179f0a

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle read by rows: T(1,1)=1,T(2,1)=1,T(2,2)=3, T(k-1,r-1)+T(k-1,r)+T(k-2,r-1).
    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-5b6052467d550b8d 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