A008459 → θ+1

OEIS matches ?

• A092443: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 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:
  0: 1;
  1: 1,   2;
  2: 1,   8,    3;
  3: 1,  18,   27,     4;
  4: 1,  32,  108,    64,     5;
  5: 1,  50,  300,   400,   125,     6;
  6: 1,  72,  675,  1600,  1125,   216,     7;
  7: 1,  98, 1323,  4900,  6125,  2646,   343,     8;
  8: 1, 128, 2352, 12544, 24500, 18816,  5488,   512,   9;
  9: 1, 162, 3888, 28224, 79380, 95256, 49392, 10368, 729, 10;

The row polynomials satisfy -(n-n^3*x)*P(n,x) = -(n-(n^3-6*n+4)*x-(3*n^3+2*n^2-3*n)*x^2)*P(n-1,x) - (2*x-(2*n^2+3*n+2)*x^2+(2*n^2+3*n)*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 - (n^3 - 6*n + 4)*x - (3*n^3 + 2*n^2 - 3*n)*x^2)*P[n - 1, x] - (2*x - (2*n^2 + 3*n + 2)*x^2 + (2*n^2 + 3*n)*x^3)*D[P[n - 1, x], x])/(-n + n^3*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 - (n^3 - 6*n + 4)*x - (3*n^3 + 2*n^2 - 3*n)*x^2)*v[i - 1] - (2*x - (2*n^2 + 3*n + 2)*x^2 + (2*n^2 + 3*n)*x^3)*deriv(v[i - 1], x))/(-n + n^3*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-1502afc95f4714aa
• 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-1502afc95f4714aa
• 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-1502afc95f4714aa
• 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-1502afc95f4714aa

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-1502afc95f4714aa

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

  • premise (sequence): Square the entries of Pascal's triangle.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-c6b04c4560617585 root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

    • preserver_image reversal, shift 0 e-1906182487ade7a7

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

      • premise (sequence): Square the entries of Pascal's triangle.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check three_term_recurrence e-c6b04c4560617585 (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. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
4. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023