A120910 → basis A013611 → basis A013610

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:         3;
  1:        21,         36;
  2:       147,        504,         432;
  3:      1029,       5292,        9072,        5184;
  4:      7203,      49392,      127008,      145152,        62208;
  5:     50421,     432180,     1481760,     2540160,      2177280,       746496;
  6:    352947,    3630312,    15558480,    35562240,     45722880,     31352832,      8957952;
  7:   2470629,   29647548,   152473104,   435637440,    746807040,    768144384,    438939648,    107495424;
  8:  17294403,  237180384,  1423082304,  4879139328,  10455298560,  14338695168,  12290310144,   6019743744,  1289945088;
  9: 121060821, 1867795524, 12807740736, 51230962944, 131736761856, 225834448896, 258096513024, 189621927936, 81266540544, 15479341056;

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

P[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[(7 + 12*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = (7 + 12*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)

Proof chains ? JSON

• Geometric basis map (elementary) polytool ? step ›

  • from basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subw…?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
        • 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
        • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
        • Parent-row provers of polytool polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
            • 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
            • 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 number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
                • ↑ Liu–Wang theorem (above)
                • ↑ Iterated real-rootedness preservers (above)
                • ↑ Parent-row provers of polytool (above)
            • Parent-row provers of polytool polytool ? step › direct check
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Liu–Wang theorem (above)
        • ↑ Iterated real-rootedness preservers (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Parent-row provers of polytool (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, …?
        • Geometric basis map (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Liu–Wang theorem (above)
            • ↑ Iterated real-rootedness preservers (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A038335 → basis A013611
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*7^j.
• A038284 → basis A013611
• A038333 → reverse
• A038271 → x ↦ x/(x+1)
• A038271 → x ↦ x/(x+1) → D
• A038284 → basis A013611 → reverse
• A038271 → x ↦ x/(x+1) → reverse
• A038284 → basis A013611 → D
• A038333 → D

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.