A081577 → basis A013611 → basis A007318

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:        1;
  1:        6,         4;
  2:       46,        56,        16;
  3:      336,       608,       352,        64;
  4:     2476,      5920,      5152,      1920,       256;
  5:    18216,     54192,     62976,     35584,      9728,      1024;
  6:   134056,    477024,    693504,    525824,    218624,     47104,      4096;
  7:   986496,   4086016,   7132416,   6788608,   3796992,   1245184,    221184,    16384;
  8:  7259536,  34304768,  69889792,  80067584,  56329216,  24879104,   6725632,  1015808,   65536;
  9: 53422176, 283618880, 660570112, 884910080, 750524416, 417419264, 152043520, 34930688, 4587520, 262144;

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

P[0, x_] := 1;
P[1, x_] := 6 + 4*x;
P[n_, x_] := P[n, x] = Expand[(10 + 8*x)*P[n - 2, x] + (6 + 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] = 6 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (10 + 8*x)*v[i - 2] + (6 + 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 Pascal-(1,2,1) array read by antidiagonals.?
    • Geometric basis map (elementary) polytool ? step ›

      • from Pascal-(1,2,1) array read by antidiagonals.?
        • 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 Pascal-(1,2,1) array read by antidiagonals.?
            • ↑ 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 Pascal-(1,2,1) array read by antidiagonals.?
                • ↑ Liu–Wang theorem with a lag row (above)
                • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Pascal-(1,2,1) array read by antidiagonals.?
        • ↑ Liu–Wang theorem with a lag row (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)

Related ?

Candidate equalities ?

• A081577 → 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