A026374 → D

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:  0;
  1:  1;
  2:  3,   2;
  3:  4,   8,   3;
  4:  6,  22,  18,    4;
  5:  7,  34,  51,   28,    5;
  6:  9,  60, 135,  120,   45,    6;
  7: 10,  78, 225,  300,  195,   60,   7;
  8: 12, 116, 432,  780,  720,  348,  84,   8;
  9: 13, 140, 606, 1356, 1695, 1212, 490, 104, 9;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; v[3] = 3 + 2*x; v[4] = 4 + 8*x + 3*x^2; for(n = 4, N, my(i = n + 1); v[i] = -(1 + 6*x + 11*x^2 + 6*x^3 + x^4)*v[i - 4] + (2 + 6*x + 2*x^2)*v[i - 2]); 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-218f1af72daab700
• 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-218f1af72daab700
• 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-218f1af72daab700

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

• preserver_image derivative_polynomial, shift 0 e-218f1af72daab700

  Laguerre’s theorem on differential operators [SP14] polytool ?

  • premise (sequence): Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers periodic_product e-6e3ca670df3d0a74 root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image reversal, shift 0 e-b2e3690a28625635

      Affine, reversal and Möbius substitutions (elementary) polytool ?

      • premise (sequence): Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ parent_provers periodic_product e-6e3ca670df3d0a74 (expanded above)

Related sequences ?

No candidate equalities or related sequences.

References

1. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.