A049029: Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0.

OEIS matches ?

• A049120: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
• A049029: triangle, 39 terms agree, 8 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 1 ?

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:
   1:            1;
   2:            5,            1;
   3:           45,           15,           1;
   4:          585,          255,          30,          1;
   5:         9945,         5175,         825,         50,         1;
   6:       208845,       123795,       24150,       2025,        75,        1;
   7:      5221125,      3427515,      775845,      80850,      4200,      105,       1;
   8:    151412625,    108046575,    27478710,    3363045,    219450,     7770,     140,     1;
   9:   4996616625,   3824996175,  1069801425,  148548330,  11482695,   514710,   13230,   180,   1;
  10: 184874815125, 150346471275, 45547251750, 7011734625, 619338825, 33100515, 1083600, 21150, 225, 1;

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

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n - 3 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (4*n - 3 + x)*v[i - 1] + x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Triangle begins:
   1:            1;
   2:            5,            1;
   3:           45,           15,           1;
   4:          585,          255,          30,          1;
   5:         9945,         5175,         825,         50,         1;
   6:       208845,       123795,       24150,       2025,        75,        1;
   7:      5221125,      3427515,      775845,      80850,      4200,      105,       1;
   8:    151412625,    108046575,    27478710,    3363045,    219450,     7770,     140,     1;
   9:   4996616625,   3824996175,  1069801425,  148548330,  11482695,   514710,   13230,   180,   1;
  10: 184874815125, 150346471275, 45547251750, 7011734625, 619338825, 33100515, 1083600, 21150, 225, 1;

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

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n - 3 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (4*n - 3 + x)*v[i - 1] + x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Proved properties

• Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0)
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-2c188005bc3e1dfc
• Coefficients of one sign. Every nonzero row, n >= 1: the coefficients of P_n 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-2c188005bc3e1dfc
• Hadamard kernel (Malo). Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)
  Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
  derived from the cited steps by a stated theorem: e-2c188005bc3e1dfc
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-2c188005bc3e1dfc
• Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: (-inf, 0] -> (-inf, 0] through R_s, s = 4, and U_g
  The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
  by the cited steps: e-77ef7b2dd3dc6607

Proof chains

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

• basis_map_theorem e-77ef7b2dd3dc6607 root: theorem check

  Index-dependent basis map [Bre89, Thm 2.4.3; MW08, Thm 2] polytool RealRooted basisMap_factorization_of_scalarIndex_recurrence RealRooted rayBasisMap_maps_realRootedIn_iff ?

• theorem_check liu_wang e-2c188005bc3e1dfc root: theorem check

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

Used in 2 proof steps

• e-80d7320f7911dda9 obreschkoff_combination → obreschkoff_combination of Triangle read by rows, the Bell transform of the quartic facto…
• e-80d7320f7911dda9 obreschkoff_combination → obreschkoff_combination of Triangle read by rows, the Bell transform of the quartic facto…

Related sequences ?

No candidate equalities or related sequences.

References

1. [Bre89] Francesco Brenti. Unimodal, log-concave and Pólya frequency sequences in combinatorics. Mem. Amer. Math. Soc., 81(413):viii+106, 1989. doi:10.1090/memo/0413
2. [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
3. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741