A085880 → x ↦ x+1 → θ+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
   1:       1;
   2:       2,        2;
   3:       8,       16,        6;
   4:      40,      120,       90,        20;
   5:     224,      896,     1008,       448,       70;
   6:    1344,     6720,    10080,      6720,     2100,      252;
   7:    8448,    50688,    95040,     84480,    39600,     9504,      924;
   8:   54912,   384384,   864864,    960960,   600600,   216216,    42042,    3432;
   9:  366080,  2928640,  7687680,  10250240,  8008000,  3843840,  1121120,  183040,  12870;
  10: 2489344, 22404096, 67212288, 104552448, 98017920, 58810752, 22870848, 5601024, 787644, 48620;

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

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((16*n - 24 + (8*n^2 - 4*n - 12)*x + (4*n^2 - 6*n)*x^2)*P[n - 1, x])/(2*n + (n^2 - n)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((16*n - 24 + (8*n^2 - 4*n - 12)*x + (4*n^2 - 6*n)*x^2)*v[i - 1])/(2*n + (n^2 - n)*x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Properties

• Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
  by Laguerre’s theorem on multiplier sequences
• Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on multiplier sequences
• Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on multiplier sequences
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
  by Laguerre’s theorem on multiplier sequences

Proof chains ? JSON

• Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

  • from basis_map_A007318 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan nu…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).?
        • Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (above)
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).?
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                • ↑ Liu–Wang theorem (above)
                • ↑ Iterated real-rootedness preservers (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).?
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).?
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).?
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A196347 → x ↦ x+1 → θ+1
• A038208 → basis A007318 → θ+1
• A156992 → basis A007318 → θ+1
• A178820 → basis A007318 → θ+1
• A038207 → θ+1
• A038330 → basis A013609 → θ+1
• A038221 → x ↦ x+1 → θ+1
• A135065 → x ↦ x+1 → θ+1
• A003506 → x ↦ x+1 → θ+1
• A178822 → x ↦ x+1 → θ+1
• A028326 → basis A007318 → θ+1
• A094305 → x ↦ x+1 → θ+1
• A038338 → x ↦ x+1 → θ+1
• A038325 → basis A007318 → θ+1
• A356546 → x ↦ x+1 → θ+1
• A132440 → D+1 → basis A013609
• A120910 → D → θ+1
• A085881 → basis A007318 → θ+1
• A027466 → basis A013611 → θ+1
• basis-map coefficients of A113214, shifted → x ↦ x+1 → θ+1
• image under θ+1 → θ+1 → D+1 → basis A013609
• A178821 → basis A007318 → θ+1
• A131431 → D+1 → basis A013609
• A120910 → θ+1

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. [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
4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.