A038336 → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:           240,            200;
  1:          4320,           7200,            3000;
  2:         69120,         172800,          144000,           40000;
  3:       1036800,        3456000,         4320000,         2400000,          500000;
  4:      14929920,       62208000,       103680000,        86400000,        36000000,         6000000;
  5:     209018880,     1045094400,      2177280000,      2419200000,      1512000000,       504000000,        70000000;
  6:    2866544640,    16721510400,     41803776000,     58060800000,     48384000000,     24192000000,      6720000000,       800000000;
  7:   38698352640,   257989017600,    752467968000,   1254113280000,   1306368000000,    870912000000,    362880000000,     86400000000,     9000000000;
  8:  515978035200,  3869835264000,  12899450880000,  25082265600000,  31352832000000,  26127360000000,  14515200000000,   5184000000000,  1080000000000,   100000000000;
  9: 6810910064640, 56757583872000, 212840939520000, 472979865600000, 689762304000000, 689762304000000, 479001600000000, 228096000000000, 71280000000000, 13200000000000, 1100000000000;

The row polynomials satisfy (n+1)*P(n,x) = (12*n+24+(10*n+20)*x)*P(n-1,x) for n >= 1, with P(0,x) = 240 + 200*x.

P[0, x_] := 240 + 200*x;
P[n_, x_] := P[n, x] = Expand[Together[((12*n + 24 + (10*n + 20)*x)*P[n - 1, x])/(n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 240 + 200*x; for(n = 1, N, my(i = n + 1); v[i] = ((12*n + 24 + (10*n + 20)*x)*v[i - 1])/(n + 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 Laguerre’s theorem on differential operators
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Laguerre’s theorem on differential operators

Proof chains ? JSON

• Laguerre’s theorem on differential operators [SP14] polytool ? step ›

  • from Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.?
    • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? 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
    • Parent-row provers of polytool polytool ? step › direct check
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*12^j.?
        • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? 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
        • 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 whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.?
            • ↑ Liu–Wang theorem (above)
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)
            • ↑ Parent-row provers of polytool (above)
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
    • ↑ Iterated real-rootedness preservers (above)

Related ?

Same fingerprint ?

• A013612 → x ↦ x+1 → reverse
• A038255 → basis A013610 → basis A013611
• A038220 → basis A013610
• A085880 → basis A013610 → basis A013609
• A013612 → x ↦ x+1 → D
• A038259: Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*5^j.
• A178822 → basis A013610 → basis A013609
• A147716 → basis A013610 → x ↦ x/(x+1)
• A038271 → basis A013609
• A178820 → basis A013610 → basis A013609
• A196347 → basis A013610 → basis A013609
• A038221 → basis A013610 → basis A013609
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*12^j.
• A013612 → x ↦ x+1
• A038329 → x ↦ x+1 → x ↦ x/(x+1)
• A038259 → D
• A178821 → basis A013610 → basis A013609
• A156992 → basis A013610 → basis A013609
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.
• A120910 → basis A013609 → basis A013610
• A038334 → basis A013610 → reverse
• A038271 → basis A013609 → D
• A038334 → basis A013610 → D
• A038291 → basis A013609 → x ↦ x/(x+1)
• A038334 → basis A013610
• A028326 → basis A013610 → basis A013609
• A038314 → D
• A038220 → basis A013610 → D
• A038338 → basis A013610 → basis A013609

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.