A344565 → (θ+1)²

nonnegative coefficients

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

Recurrence
\(\left(n - n x + 3\,n^{2} x + n^{3} x^{2}\right)\,P_{n}(x) = \left(4 + 12\,x + 12\,x^{2} + 4\,x^{3} + n + 15\,n x + 23\,n x^{2} + 9\,n x^{3} + 3\,n^{2} x + 9\,n^{2} x^{2} + 6\,n^{2} x^{3} + n^{3} x^{2} + n^{3} x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 3\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
033
1156075
245360405810
31051260283516805880
421033601134013440525033600
5378756034020604804725013608163296
6630151208505020160023625013608030870705600
799027720187110554400866250748440339570633602787840

Computed in your browser ?

Technical details
Node id
n-3872500ae150330f · revision 1 · JSON
Definition source
derived:theta_plus_one_squared
Fingerprint
f6-d42e6339eab21b9c

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 0)
  • 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    3;
  1:   15,    60;
  2:   45,   360,    405;
  3:  105,  1260,   2835,    1680;
  4:  210,  3360,  11340,   13440,    5250;
  5:  378,  7560,  34020,   60480,   47250,   13608;
  6:  630, 15120,  85050,  201600,  236250,  136080,   30870;
  7:  990, 27720, 187110,  554400,  866250,  748440,  339570,   63360;
  8: 1485, 47520, 374220, 1330560, 2598750, 2993760, 2037420,  760320,  120285;
  9: 2145, 77220, 694980, 2882880, 6756750, 9729720, 8828820, 4942080, 1563705, 214500;
%F Formula
The row polynomials satisfy (n+(3*n^2-n)*x+n^3*x^2)*P(n,x) = (n+4+(3*n^2+15*n+12)*x+(n^3+9*n^2+23*n+12)*x^2+(n^3+6*n^2+9*n+4)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 3.
%t Mathematica
P[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((n + 4 + (3*n^2 + 15*n + 12)*x + (n^3 + 9*n^2 + 23*n + 12)*x^2 + (n^3 + 6*n^2 + 9*n + 4)*x^3)*P[n - 1, x])/(n + (3*n^2 - n)*x + n^3*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((n + 4 + (3*n^2 + 15*n + 12)*x + (n^3 + 9*n^2 + 23*n + 12)*x^2 + (n^3 + 6*n^2 + 9*n + 4)*x^3)*v[i - 1])/(n + (3*n^2 - n)*x + n^3*x^2)); 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)

Generated with polytool c48629374597.

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-499b0a6a3661d54f
  • 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-499b0a6a3661d54f
  • 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-499b0a6a3661d54f
  • 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-499b0a6a3661d54f

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

Same fingerprint (12)

Equal up to content, sign, reversal and a small index shift.

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.