A145596 → θ+1

OEIS matches ?

• A002694: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 2 ?

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,   4;
  2:  3,  16,    9;
  3:  4,  40,   60,    16;
  4:  5,  80,  225,   160,     25;
  5:  6, 140,  630,   840,    350,     36;
  6:  7, 224, 1470,  3136,   2450,    672,    49;
  7:  8, 336, 3024,  9408,  11760,   6048,  1176,    64;
  8:  9, 480, 5670, 24192,  44100,  36288, 13230,  1920,   81;
  9: 10, 660, 9900, 55440, 138600, 166320, 97020, 26400, 2970, 100;

The row polynomials satisfy (n^2+4*n+(n^4+6*n^3+8*n^2)*x)*P(n,x) = (n^2+5*n+4+(n^4+7*n^3+20*n^2+18*n+4)*x+(3*n^4+15*n^3+23*n^2+15*n+4)*x^2)*P(n-1,x) + ((2*n+2)*x+(2*n^3+9*n^2+9*n+2)*x^2-(2*n^3+9*n^2+11*n+4)*x^3)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + 5*n + 4 + (n^4 + 7*n^3 + 20*n^2 + 18*n + 4)*x + (3*n^4 + 15*n^3 + 23*n^2 + 15*n + 4)*x^2)*P[n - 1, x] + ((2*n + 2)*x + (2*n^3 + 9*n^2 + 9*n + 2)*x^2 - (2*n^3 + 9*n^2 + 11*n + 4)*x^3)*D[P[n - 1, x], x])/(n^2 + 4*n + (n^4 + 6*n^3 + 8*n^2)*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^2 + 5*n + 4 + (n^4 + 7*n^3 + 20*n^2 + 18*n + 4)*x + (3*n^4 + 15*n^3 + 23*n^2 + 15*n + 4)*x^2)*v[i - 1] + ((2*n + 2)*x + (2*n^3 + 9*n^2 + 9*n + 2)*x^2 - (2*n^3 + 9*n^2 + 11*n + 4)*x^3)*deriv(v[i - 1], x))/(n^2 + 4*n + (n^4 + 6*n^3 + 8*n^2)*x)); 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-fabeda6299c4c4d1
• 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-fabeda6299c4c4d1
• 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-fabeda6299c4c4d1
• 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-fabeda6299c4c4d1

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-fabeda6299c4c4d1

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

  • premise (sequence): basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-c483eeee9c2638c9 root: theorem check

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

    • preserver_image reversal, shift 0 e-1d2c7b4a3cb3d72f

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

      • premise (sequence): basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check liu_wang e-c483eeee9c2638c9 (expanded above)
        • basis_map A007318 e-fb63394f9047a486

          Geometric basis map (elementary) polytool ?

          • premise (sequence): basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1]
            • preserver_image affine, shift 0 e-3babd9179153850c

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

              • premise (sequence): basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
                • ↵ theorem_check liu_wang e-c483eeee9c2638c9 (expanded above)
    • ↵ basis_map A007318 e-fb63394f9047a486 (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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.