A051523: Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 9.

OEIS matches ?

• A051523: triangle, 45 terms agree, 9 full rows row-aligned (tabl) in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

Triangle begins:
  0:            1;
  1:          -10,           1;
  2:          110,         -21,           1;
  3:        -1320,         362,         -33,         1;
  4:        17160,       -6026,         791,       -46,         1;
  5:      -240240,      101524,      -17100,      1435,       -60,       1;
  6:      3603600,    -1763100,      358024,    -38625,      2335,     -75,       1;
  7:    -57657600,    31813200,    -7491484,    976024,    -75985,    3535,     -91,    1;
  8:    980179200,  -598482000,   159168428, -24083892,   2267769, -136080,    5082, -108,    1;
  9: -17643225600, 11752855200, -3463513704, 592678484, -64903734, 4717209, -227556, 7026, -126, 1;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(n + 9 - x)*P[n - 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] = -(n + 9 - 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)

Triangle begins:
  0:            1;
  1:          -10,           1;
  2:          110,         -21,           1;
  3:        -1320,         362,         -33,         1;
  4:        17160,       -6026,         791,       -46,         1;
  5:      -240240,      101524,      -17100,      1435,       -60,       1;
  6:      3603600,    -1763100,      358024,    -38625,      2335,     -75,       1;
  7:    -57657600,    31813200,    -7491484,    976024,    -75985,    3535,     -91,    1;
  8:    980179200,  -598482000,   159168428, -24083892,   2267769, -136080,    5082, -108,    1;
  9: -17643225600, 11752855200, -3463513704, 592678484, -64903734, 4717209, -227556, 7026, -126, 1;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(n + 9 - x)*P[n - 1, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {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 + 9 - x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

Proved properties

• Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in [19/2, +inf)
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-85dd368cbda0ff5a
• Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n(-x) have one sign
  All coefficients of each polynomial have the same sign (after x -> -x when alternating).
  derived from the cited steps by a stated theorem: e-85dd368cbda0ff5a
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-85dd368cbda0ff5a

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

• preserver_image affine, shift 0 e-85dd368cbda0ff5a

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

  • premise (sequence): Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-59b849691f316c6f root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

    • parent_provers root_domain e-ef36674c01230a86 root: theorem check

      Parent-row provers of polytool polytool ?

Used in 2 proof steps

• e-9a862b15d72a4b43 obreschkoff_combination → obreschkoff_combination of Generalized Stirling number triangle of first kind read by row…
• e-9a862b15d72a4b43 obreschkoff_combination → obreschkoff_combination of Generalized Stirling number triangle of first kind read by row…

Related sequences ?

No candidate equalities or related sequences.

References

1. [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