A196347 → basis A013609

OEIS matches ?

• A047053: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 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:         2,          2;
  2:         8,         16,          8;
  3:        48,        144,        144,          48;
  4:       384,       1536,       2304,        1536,         384;
  5:      3840,      19200,      38400,       38400,       19200,        3840;
  6:     46080,     276480,     691200,      921600,      691200,      276480,       46080;
  7:    645120,    4515840,   13547520,    22579200,    22579200,    13547520,     4515840,     645120;
  8:  10321920,   82575360,  289013760,   578027520,   722534400,   578027520,   289013760,   82575360,   10321920;
  9: 185794560, 1672151040, 6688604160, 15606743040, 23410114560, 23410114560, 15606743040, 6688604160, 1672151040, 185794560;

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

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

Proved properties

• Real-rooted. Every row P_n, n >= 0, 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-8cc9e74a0552ef08
• Coefficients of one sign. Every nonzero row, n >= 0: 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-8cc9e74a0552ef08
• Hadamard kernel (Malo). Rows P_n, n >= 0, 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-8cc9e74a0552ef08

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

• basis_map A013609 e-8cc9e74a0552ef08

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-61ffea65f7eec286 root: theorem check

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

    • basis_map A007318 e-83332bc01455e815

      Geometric basis map (elementary) polytool ?

      • premise (sequence): Triangle read by rows: row n consists of n zeros followed by n!.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • parent_provers root_domain e-8128a83cc2062067 root: theorem check

          Parent-row provers of polytool polytool ?

        • preserver_image mobius, shift 0 e-7d7235cf57d80f69

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

          • premise (sequence): Triangle read by rows: row n consists of n zeros followed by n!.
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • ↵ parent_provers root_domain e-8128a83cc2062067 (expanded above)
    • parent_provers root_domain e-bf1e7898c429e3eb root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image affine, shift 0 e-ab4aac9d5a3bd564

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

      • premise (sequence): Triangle read by rows: row n consists of n zeros followed by n!.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ parent_provers root_domain e-8128a83cc2062067 (expanded above)
        • ↵ preserver_image mobius, shift 0 e-7d7235cf57d80f69 (expanded above)

Related sequences ?

Same fingerprint (59)

Equal up to content, sign, reversal and a small index shift.

• A344565 → D
• A344565 → basis A013609
• A028326 → D
• A038208 → D
• A085881 → basis A013609
• A178821 → basis A013609
• A007318 → ×(1+(3/2)n+(1/2)n²) → D
• A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*12^j.
• basis-map coefficients of A113214, shifted → basis A013609
• basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
• A038221 → basis A013609
• A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
• basis-map coefficients of A112227 → x ↦ x+1
• A178821: Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
• A038330 → basis A013611
• A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
• basis-map coefficients of A026729 → basis A007318
• A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
• A038325 → basis A013609
• basis-map coefficients of A026729, shifted → basis A007318
• A007318: Binomial
• A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
• A356546 → basis A013609
• Riordan array (1-x,x/(1-x)).
• A178822 → D
• A178821 → D
• A085881: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
• A094305: Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
• A196347: Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
• A085880 → D
• A135838 → D
• A156992: Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
• A038325: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.
• A028326 → basis A013609
• A178822: Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.
• A007318 → ×(−(1/2)n+(1/2)n²) → D
• A007318 → ×(1+2n+n²) → D
• A129533: Array read by antidiagonals: T(n,k) = binomial(n+1,2)*binomial(n+k,n+1) for 0 <= k <= n.
• A178820 → basis A013609
• A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
• A038338 → basis A013609
• A120910 → basis A013610
• A135065: A127733 * A007318 as infinite lower triangular matrices.
• A216973: Exponential Riordan array [x*exp(x),x].
• A178822 → basis A013609
• A356546: Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
• basis-map coefficients of A113214, shifted → D
• A135838 → basis A013609
• basis-map coefficients of A021012 → x ↦ x+1
• A178820 → D
• A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
• A085880 → basis A013609
• A085880: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A00010…
• A003506: Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
• A027465 → basis A013611
• A010054 → reverse → x ↦ x+1
• A007318 → D → D
• A156992 → basis A013609

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