A091044 → basis A013609 → basis A013609

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:        1;
  1:        8,         8;
  2:       60,       112,         48;
  3:      448,      1216,       1024,        256;
  4:     3344,     11904,      14976,       7680,       1280;
  5:    24960,    109952,     184320,     144384,      51200,       6144;
  6:   186304,    978176,    2050304,    2168832,    1197056,     315392,      28672;
  7:  1390592,   8476672,   21331968,   28467200,   21463040,    8945664,    1835008,    131072;
  8: 10379520,  72044544,  211636224,  341262336,  327147520,  188153856,   61931520,  10223616,   589824;
  9: 77473792, 603236352, 2026242048, 3832381440, 4464640000, 3287744512, 1506803712, 404226048, 55050240, 2621440;

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

P[0, x_] := 1;
P[1, x_] := 8 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(4 + 16*x + 16*x^2)*P[n - 2, x] + (8 + 8*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] = 8 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(4 + 16*x + 16*x^2)*v[i - 2] + (8 + 8*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)

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Geometric basis map (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Geometric basis map (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from 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 One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
    • Geometric basis map (elementary) polytool ? step ›

      • from One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] 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
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
            • ↑ Three-term recurrence criterion (above)
            • ↑ Liu–Wang theorem for three-term recurrences (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
                • ↑ Three-term recurrence criterion (above)
                • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
        • ↑ Three-term recurrence criterion (above)
        • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [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
3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023