A118933 → 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:     1;
  2:     1;
  3:     1;
  4:     7,     6;
  5:    31,    30;
  6:    91,    90;
  7:   211,   210;
  8:  1681,  4200,  1260;
  9: 12097, 34776, 11340;

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

P[0, x_] := 1;
P[1, x_] := 1;
P[2, x_] := 1;
P[3, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n^3 - 6*n^2 + 11*n - 6 + (n^3 - 6*n^2 + 11*n - 6)*x)*P[n - 4, x] + (n^3 - 6*n^2 + 11*n - 6)*x*D[P[n - 4, x], 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] = 1; v[3] = 1; v[4] = 1; for(n = 4, N, my(i = n + 1); v[i] = (n^3 - 6*n^2 + 11*n - 6 + (n^3 - 6*n^2 + 11*n - 6)*x)*v[i - 4] + (n^3 - 6*n^2 + 11*n - 6)*x*deriv(v[i - 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-510f97d2d65daac7
• 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-510f97d2d65daac7
• 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-510f97d2d65daac7

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-510f97d2d65daac7

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

  • premise (sequence): Triangle, read by rows, where T(n,k) = n!/(k!*(n-4*k)!*4^k) for n>=4*k>=0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers paper_theorem e-281e0bfa773c0053 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

No candidate equalities or related sequences.

References

1. [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