A116412 → basis A013611 → basis A007318

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:        1;
  1:        8,         4;
  2:       61,        64,        16;
  3:      467,       744,       384,         64;
  4:     3574,      7640,      6000,       2048,       256;
  5:    27353,     73364,     77456,      40192,     10240,      1024;
  6:   209341,    675456,    896208,     625408,    241920,     49152,      4096;
  7:  1602152,   6041788,   9656016,    8473472,   4407040,   1357824,    229376,    16384;
  8: 12261769,  52915768,  98942128,  104650240,  68454400,  28346368,   7254016,  1048576,   65536;
  9: 93843143, 456075000, 976705200, 1209311616, 953710848, 496659456, 170741760, 37355520, 4718592, 262144;

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

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

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_A013611 of Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).?
    • Geometric basis map (elementary) polytool ? step ›

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

          • from Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
            • 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 Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).?
                • ↑ Liu–Wang theorem for three-term recurrences (above)
                • ↑ Liu–Wang theorem with a lag row (above)
                • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

                  • from Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
                    • ↑ 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 Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).?
                        • ↑ Liu–Wang theorem for three-term recurrences (above)
                        • ↑ Liu–Wang theorem with a lag row (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).?
        • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Liu–Wang theorem with a lag row (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Candidate equalities ?

• A116412 → basis A013611 → x ↦ x+1 15 rows; no all-index equality certificate was found

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