A034870 → D

OEIS matches ?

• A018215: 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:  0;
  1:  2,   2;
  2:  4,  12,   12,     4;
  3:  6,  30,   60,    60,    30,      6;
  4:  8,  56,  168,   280,   280,    168,     56,      8;
  5: 10,  90,  360,   840,  1260,   1260,    840,    360,     90,     10;
  6: 12, 132,  660,  1980,  3960,   5544,   5544,   3960,   1980,    660,    132,     12;
  7: 14, 182, 1092,  4004, 10010,  18018,  24024,  24024,  18018,  10010,   4004,   1092,    182,    14;
  8: 16, 240, 1680,  7280, 21840,  48048,  80080, 102960, 102960,  80080,  48048,  21840,   7280,  1680,   240,   16;
  9: 18, 306, 2448, 12240, 42840, 111384, 222768, 350064, 437580, 437580, 350064, 222768, 111384, 42840, 12240, 2448, 306, 18;

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

P[0, x_] := 0;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((n + 2*n*x + n*x^2)*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] = 0; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((n + 2*n*x + n*x^2)*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)

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-473cc94657c879cc
• 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-473cc94657c879cc
• 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-473cc94657c879cc

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 derivative_polynomial, shift 0 e-473cc94657c879cc

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

  • premise (sequence): Even-numbered rows of Pascal's triangle.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers periodic_product e-0029b53144d984cf root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image reversal, shift 0 e-a3e5463f21dc8d9d

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

      • premise (sequence): Even-numbered rows of Pascal's triangle.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ parent_provers periodic_product e-0029b53144d984cf (expanded above)
        • basis_map A007318 e-fc612a08cfe0bbb6

          Geometric basis map (elementary) polytool ?

          • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • parent_provers periodic_product e-1991a148b9538b93 root: theorem check

              Parent-row provers of polytool polytool ?

            • preserver_image mobius, shift 0 e-12303ad0e0b9f8eb

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

              • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
                • ↵ parent_provers periodic_product e-1991a148b9538b93 (expanded above)
        • preserver_image affine, shift 0 e-5b79b5b4d4f1c577

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

          • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • ↵ parent_provers periodic_product e-1991a148b9538b93 (expanded above)
            • ↵ preserver_image mobius, shift 0 e-12303ad0e0b9f8eb (expanded above)
    • ↵ basis_map A007318 e-fc612a08cfe0bbb6 (expanded above)
    • ↵ preserver_image affine, shift 0 e-5b79b5b4d4f1c577 (expanded above)

Related sequences ?

No candidate equalities or related sequences.

References

1. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.