A094816 → θ+1

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence
\(P_{n}(x) = \left(-12 + 7\,n - n^{2}\right)\,P_{n-4}(x) + \left(15 - 6\,x - 11\,n + 2\,n x + 2\,n^{2}\right)\,P_{n-3}(x) + \left(1 + 4\,x - x^{2} + 2\,n - 2\,n x - n^{2}\right)\,P_{n-2}(x) + \left(-3 + 2\,x + 2\,n\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 2\,x\)
\(P_{3}(x) = 1 + 6\,x + 3\,x^{2}\)
\(P_{4}(x) = 1 + 16\,x + 18\,x^{2} + 4\,x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2123
316310
411618439
514887405181
61178435300756995
718302442218080012676386
814744157291671678751806196847075

Computed in your browser ?

Technical details
Node id
n-09fe24554ecad418 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-5b1a75818c2e4758

Observed on the stored rows ?

  • Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept -1)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

OEIS matches ?

No OEIS matches.

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.

The atlas's own rows: n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1;
   2: 1,      2;
   3: 1,      6,      3;
   4: 1,     16,     18,       4;
   5: 1,     48,     87,      40,      5;
   6: 1,    178,    435,     300,     75,      6;
   7: 1,    830,   2442,    2180,    800,    126,     7;
   8: 1,   4744,  15729,   16716,   7875,   1806,   196,    8;
   9: 1,  32144, 115854,  139440,  78295,  23016,  3626,  288,   9;
  10: 1, 251346, 965070, 1275704, 815955, 286650, 57918, 6672, 405, 10;
%F Formula
The row polynomials satisfy P(n,x) = -(n^2-7*n+12)*P(n-4,x) + (2*n^2-11*n+15+(2*n-6)*x)*P(n-3,x) - (n^2-2*n-1+(2*n-4)*x+x^2)*P(n-2,x) + (2*n-3+2*x)*P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 1 + 2*x, P(3,x) = 1 + 6*x + 3*x^2, P(4,x) = 1 + 16*x + 18*x^2 + 4*x^3.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + 2*x;
P[3, x_] := 1 + 6*x + 3*x^2;
P[4, x_] := 1 + 16*x + 18*x^2 + 4*x^3;
P[n_, x_] := P[n, x] = Expand[-(n^2 - 7*n + 12)*P[n - 4, x] + (2*n^2 - 11*n + 15 + (2*n - 6)*x)*P[n - 3, x] - (n^2 - 2*n - 1 + (2*n - 4)*x + x^2)*P[n - 2, x] + (2*n - 3 + 2*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; v[3] = 1 + 6*x + 3*x^2; v[4] = 1 + 16*x + 18*x^2 + 4*x^3; for(n = 5, N, my(i = n); v[i] = -(n^2 - 7*n + 12)*v[i - 4] + (2*n^2 - 11*n + 15 + (2*n - 6)*x)*v[i - 3] - (n^2 - 2*n - 1 + (2*n - 4)*x + x^2)*v[i - 2] + (2*n - 3 + 2*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, v[i])))};
T(10)

Generated with polytool c48629374597.

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-5475cc59f67df9f4
  • 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-5475cc59f67df9f4
  • 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-5475cc59f67df9f4
  • 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-5475cc59f67df9f4

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

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