A011973 → basis A013609 → x ↦ x+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:    1;
  1:    1;
  2:    4,    2;
  3:    7,    4;
  4:   19,   18,    4;
  5:   40,   44,   12;
  6:   97,  136,   60,   8;
  7:  217,  348,  184,  32;
  8:  508,  950,  636, 176, 16;
  9: 1159, 2428, 1884, 640, 80;

The row polynomials satisfy 2*n*P(n,x) = (14*n-12+(8*n-8)*x)*P(n-1,x) - (39+50*x+16*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((14*n - 12 + (8*n - 8)*x)*P[n - 1, x] - (39 + 50*x + 16*x^2)*D[P[n - 1, x], x])/(2*n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((14*n - 12 + (8*n - 8)*x)*v[i - 1] - (39 + 50*x + 16*x^2)*deriv(v[i - 1], x))/(2*n)); 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 (−∞, -1]
  by Affine, reversal and Möbius substitutions (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Affine, reversal and Möbius substitutions (elementary), Geometric basis map (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Affine, reversal and Möbius substitutions (elementary), Geometric basis map (elementary)
• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Geometric basis map (elementary)
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Geometric basis map (elementary)

Proof chains ? JSON

• Geometric basis map (elementary) polytool ? step ›

  • from basis_map_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
        • Parent-row provers of polytool polytool ? step › direct check
        • Parent-row provers of polytool polytool ? step › direct check
        • Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›

          • from delannoy?
            • Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
            • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from delannoy?
                • ↑ Liu–Wang theorem with a lag row (above)
                • ↑ Liu–Wang theorem for three-term recurrences (above)
                • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

                  • from delannoy?
                    • ↑ Liu–Wang theorem with a lag row (above)
                    • ↑ Liu–Wang theorem for three-term recurrences (above)
                    • Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›

                      • from a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
                        no recorded property covers this requirement
                    • Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›

                      • from a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
                        no recorded property covers this requirement
                • ↑ Affine-current basis map theorem (above)
                • ↑ Affine-current basis map theorem (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
            • ↑ Affine-current basis map theorem (above)
            • ↑ Affine-current basis map theorem (above)
        • Parent-row provers of polytool polytool ? step › direct check
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
        • ↑ Parent-row provers of polytool (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Gamma criterion (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)
• Ore-algebra identity of two definitions polytool ? step › direct check
• Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

  • from basis_map_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
    • ↑ Geometric basis map (elementary) (above)
    • ↑ Geometric basis map (elementary) (above)

Related ?

Same fingerprint ?

• A249139 → basis A013609
• A052553 → basis A013609 → x ↦ x+1

References

1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003