A001263 → θ+1 → x ↦ x/(x+1)

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0: 1;
  1: 1,  3;
  2: 1,  8,   10;
  3: 1, 15,   45,    35;
  4: 1, 24,  126,   224,    126;
  5: 1, 35,  280,   840,   1050,    462;
  6: 1, 48,  540,  2400,   4950,   4752,   1716;
  7: 1, 63,  945,  5775,  17325,  27027,  21021,   6435;
  8: 1, 80, 1540, 12320,  50050, 112112, 140140,  91520,  24310;
  9: 1, 99, 2376, 24024, 126126, 378378, 672672, 700128, 393822, 92378;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + n + (4*n^2 + 5*n + 1)*x + (5*n^2 + 7*n + 2)*x^2 + (2*n^2 + 3*n + 1)*x^3)*P[n - 1, x] + ((2*n + 1)*x + (6*n + 3)*x^2 + (6*n + 3)*x^3 + (2*n + 1)*x^4)*D[P[n - 1, x], x])/(n^2 + n + (2*n^2 + 2*n)*x + (n^2 + n)*x^2)]];
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] = ((n^2 + n + (4*n^2 + 5*n + 1)*x + (5*n^2 + 7*n + 2)*x^2 + (2*n^2 + 3*n + 1)*x^3)*v[i - 1] + ((2*n + 1)*x + (6*n + 3)*x^2 + (6*n + 3)*x^3 + (2*n + 1)*x^4)*deriv(v[i - 1], x))/(n^2 + n + (2*n^2 + 2*n)*x + (n^2 + n)*x^2)); 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 theta_plus_one of Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also call…?
    • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

      • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
        • 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
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
            • ↑ Liu–Wang theorem for three-term recurrences (above)
            • ↑ Three-term recurrence criterion (above)
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
                • ↑ Liu–Wang theorem for three-term recurrences (above)
                • ↑ Three-term recurrence criterion (above)
                • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    • Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›

      • from Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
        • ↑ Liu–Wang theorem for three-term recurrences (above)
        • ↑ Three-term recurrence criterion (above)
        • ↑ Row-hypergeometric rows (multiplier sequences) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A253283 → D
• A109983 → θ+1
• narayana → θ+1 → x ↦ x/(x+1)
• A069466 → basis A007318 → D
• A008459 → x ↦ x+1 → D
• A104684 → D

References

1. [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
2. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
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.
5. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023