A078812 → 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:
   1:    1;
   2:    3,      1;
   3:    8,      7,      1;
   4:   21,     35,     12,      1;
   5:   55,    154,     94,     18,      1;
   6:  144,    636,    612,    201,     25,      1;
   7:  377,   2534,   3602,   1800,    375,     33,     1;
   8:  987,   9877,  19932,  14201,   4400,    638,    42,    1;
   9: 2584,  37961, 105935, 103338,  44626,   9471,  1015,   52,  1;
  10: 6765, 144551, 547704, 711762, 411320, 119756, 18564, 1534, 63, 1;

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

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

P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = -v[i - 2] + (3 + 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, v[i])))};
T(10)

Proved properties

• Real-rooted. Every row P_n, n >= 1, 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-13742d707ef3ea03
• Coefficients of one sign. Every nonzero row, n >= 1: 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-13742d707ef3ea03
• Hadamard kernel (Malo). Rows P_n, n >= 1, 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-13742d707ef3ea03

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-13742d707ef3ea03

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

  • premise (sequence): Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-537ef91063de36e5 root: theorem check

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

    • theorem_check three_term_recurrence e-5aa1c8cf88fab58c 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