A143495 → θ+1

OEIS matches ?

• A045379: 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:
   1:     1;
   2:     3,      2;
   3:     9,     14,       3;
   4:    27,     74,      36,       4;
   5:    81,    350,     291,      72,       5;
   6:   243,   1562,    1980,     820,     125,      6;
   7:   729,   6734,   12243,    7560,    1900,    198,      7;
   8:  2187,  28394,   71316,   61684,   22750,   3864,    294,     8;
   9:  6561, 117950,  399171,  465192,  236355,  58212,   7154,   416,   9;
  10: 19683, 484922, 2172780, 3323380, 2235975, 749322, 132300, 12336, 567, 10;

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

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

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-8b885dd48ba326e7
• 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-8b885dd48ba326e7
• 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-8b885dd48ba326e7
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-8b885dd48ba326e7

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 euler_polynomial, shift 0 e-8b885dd48ba326e7

  Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?

  • premise (sequence): Triangle read by rows: 3-Stirling numbers of the second kind.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-4d8fac6359540276 root: theorem check

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

    • preserver_image derivative_polynomial, shift 0 e-95a6a1104a7cd304

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

      • premise (sequence): Triangle read by rows: 2-Stirling numbers of the second kind.
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check liu_wang e-d198e25506383784 root: theorem check

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

        • preserver_image derivative_polynomial, shift 0 e-34c9c7195bdd20aa

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

          • premise (sequence): Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
            uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
            • theorem_check liu_wang e-995393ce4e49a8d6 root: theorem check

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

            • basis_map A008277 e-c52960bc5e97caa0

              Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?

              • premise (sequence): basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
                uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
                • parent_provers periodic_product e-6e85c0971e84e272 root: theorem check

                  Parent-row provers of polytool polytool ?

                • preserver_image mobius, shift 0 e-ad67990681a86223

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

                  • premise (sequence): basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
                    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
                    • ↵ parent_provers periodic_product e-6e85c0971e84e272 (expanded above)
            • preserver_image reversal, shift 0 e-d527982dc7c0aa3b

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

              • premise (sequence): Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.
                uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
                • theorem_check liu_wang e-8e580efc86a38a12 root: theorem check

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

                • preserver_image reversal, shift 0 e-3256729839b26765

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

                  • premise (sequence): Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
                    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
                    • ↵ theorem_check liu_wang e-995393ce4e49a8d6 (expanded above)
                    • ↵ basis_map A008277 e-c52960bc5e97caa0 (expanded above)

Related sequences ?

No candidate equalities or related sequences.

References

1. [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
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
4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.