A116414 → 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:      5,       1;
  2:     22,      11,       1;
  3:     95,      85,      18,       1;
  4:    409,     572,     208,      26,       1;
  5:   1760,    3586,    1974,     413,      35,      1;
  6:   7573,   21560,   16780,    5200,     725,     45,     1;
  7:  32585,  126175,  133098,   57141,   11620,   1172,    56,    1;
  8: 140206,  724955, 1007521,  574626,  159546,  23205,  1785,   68,  1;
  9: 603275, 4111411, 7378308, 5433106, 1975680, 388080, 42672, 2598, 81, 1;

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

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

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-d0a93af714a782e4

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

  • premise (sequence): Riordan array (1/((1-x)(1-3x)),x/((1-x)(1-3x))).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-894010de7c322dc8 root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

    • theorem_check three_term_recurrence e-7bedda0241d23786 root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

Related sequences ?

No candidate equalities or related sequences.

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
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
3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023