A026374 → θ+1 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:  0;
  1:  2;
  2:  6,   6;
  3:  8,  24,   12;
  4: 12,  66,   72,   20;
  5: 14, 102,  204,  140,    30;
  6: 18, 180,  540,  600,   270,   42;
  7: 20, 234,  900, 1500,  1170,  420,   56;
  8: 24, 348, 1728, 3900,  4320, 2436,  672,  72;
  9: 26, 420, 2424, 6780, 10170, 8484, 3920, 936, 90;

The row polynomials satisfy P(n,x) = (1+9*x+30*x^2+45*x^3+30*x^4+9*x^5+x^6)*P(n-6,x) - (3+18*x+33*x^2+18*x^3+3*x^4)*P(n-4,x) + (3+9*x+3*x^2)*P(n-2,x) for n >= 6, with P(0,x) = 0, P(1,x) = 2, P(2,x) = 6 + 6*x, P(3,x) = 8 + 24*x + 12*x^2, P(4,x) = 12 + 66*x + 72*x^2 + 20*x^3, P(5,x) = 14 + 102*x + 204*x^2 + 140*x^3 + 30*x^4.

P[0, x_] := 0;
P[1, x_] := 2;
P[2, x_] := 6 + 6*x;
P[3, x_] := 8 + 24*x + 12*x^2;
P[4, x_] := 12 + 66*x + 72*x^2 + 20*x^3;
P[5, x_] := 14 + 102*x + 204*x^2 + 140*x^3 + 30*x^4;
P[n_, x_] := P[n, x] = Expand[(1 + 9*x + 30*x^2 + 45*x^3 + 30*x^4 + 9*x^5 + x^6)*P[n - 6, x] - (3 + 18*x + 33*x^2 + 18*x^3 + 3*x^4)*P[n - 4, x] + (3 + 9*x + 3*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] = 2; v[3] = 6 + 6*x; v[4] = 8 + 24*x + 12*x^2; v[5] = 12 + 66*x + 72*x^2 + 20*x^3; v[6] = 14 + 102*x + 204*x^2 + 140*x^3 + 30*x^4; for(n = 6, N, my(i = n + 1); v[i] = (1 + 9*x + 30*x^2 + 45*x^3 + 30*x^4 + 9*x^5 + x^6)*v[i - 6] - (3 + 18*x + 33*x^2 + 18*x^3 + 3*x^4)*v[i - 4] + (3 + 9*x + 3*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)

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Laguerre’s theorem on differential operators
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators

Proof chains ? JSON

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

  • from theta_plus_one of 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) f…?
    • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

      • from 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< = …?
        • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
        • Parent-row provers of polytool polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from 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< = …?
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Parent-row provers of polytool (above)

References

1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
2. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.