A102662 → basis A008277

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,      3;
  2:    9,     14,      3;
  3:   22,     61,     29,       3;
  4:   53,    242,    200,      47,      3;
  5:  128,    923,   1190,     476,     68,      3;
  6:  309,   3434,   6525,    3958,    946,     92,     3;
  7:  746,  12585,  34027,   29409,  10450,   1676,   119,    3;
  8: 1801,  45678, 171702,  203429, 100797,  23680,  2741,  149,   3;
  9: 4348, 164751, 847152, 1340510, 889870, 287063, 48117, 4225, 182, 3;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 2] + x*deriv(v[i - 2], x) + (2 + x)*v[i - 1] + x*deriv(v[i - 1], x)); 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-ac324c30ef49a129
• 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-ac324c30ef49a129
• 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-ac324c30ef49a129

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 A008277 e-ac324c30ef49a129

  Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?

  • 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
2. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741