A225470 → basis A013610 → x ↦ x/(x+1)

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:          1;
  1:          3,           6;
  2:         18,          63,           54;
  3:        162,         783,         1242,           648;
  4:       1944,       11826,        26649,         26406,          9720;
  5:      29160,      212382,       612603,        875772,        621108,        174960;
  6:     524880,     4435236,     15486876,      28628559,      29571156,      16192548,       3674160;
  7:   11022480,   105737076,    431670060,     972884763,    1308079692,    1049751252,     465778512,      88179840;
  8:  264539520,  2835296784,  13214982492,   35004325932,   57661801209,   60512181732,   39521968092,   14692335984,   2380855680;
  9: 7142567040, 84489198768, 441863430804, 1341566274924, 2606998410603, 3363682943034, 2882458590444, 1582352114328, 505053182880, 71425670400;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((3*n + (6*n + 3)*x + (3*n + 3)*x^2)*P[n - 1, x])/(1 + x)]];
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] = ((3*n + (6*n + 3)*x + (3*n + 3)*x^2)*v[i - 1])/(1 + x)); 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, 0]
  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)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

• Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

  • from basis_map_A013610 of Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
            • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • Geometric basis map (elementary) polytool ? step ›

              • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
                • Parent-row provers of polytool polytool ? step › direct check
            • Geometric basis map (elementary) polytool ? step ›

              • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
                • ↑ Parent-row provers of polytool (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…?
                • ↑ Parent-row provers of polytool (above)
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
            • ↑ Liu–Wang theorem (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Geometric basis map (elementary) (above)
            • ↑ Geometric basis map (elementary) (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • Parent-row provers of polytool polytool ? step › direct check
        • 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 read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…?
            • ↑ Liu–Wang theorem (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Geometric basis map (elementary) (above)
            • ↑ Geometric basis map (elementary) (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
        • ↑ Liu–Wang theorem (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Geometric basis map (elementary) (above)
        • ↑ Parent-row provers of polytool (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A130534 → x ↦ x/(x+1)
• A088996: Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
• A059364: Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.
• A059364 → reverse
• A088996 → reverse
• A225471 → basis A013611 → x ↦ x/(x+1)
• A028338 → basis A013609 → x ↦ x/(x+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.