A143683 → θ+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 + 2\,n x + 17\,n x^{2} - 9\,n^{2} x + 9\,n^{2} x^{2}\right)\,P_{n}(x) = \left(34\,x + 292\,x^{2} + 34\,x^{3} - n - 34\,n x - 127\,n x^{2} + 18\,n x^{3} - 9\,n^{2} x - 153\,n^{2} x^{2}\right)\,P_{n-1}(x) + \left(x + 51\,x^{2} + 579\,x^{3} + 17\,x^{4} + 9\,n x^{2} + 306\,n x^{3} + 9\,n x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1123
2120324
3138574100
41563541125528
5174894119218562352
6192167761602795276711008
71110270317932224155406385848960
811283972394241064305913692685129218880
911465484735523350304020361287161462465710960256
10116472391232328212101825800114969424646421717820114196352
111182923719138017107706027540703213027372324306053079010011218170880
12120011478280912318231515964080311050602128544057281677022804208612001378303232
131218139623947445447255362062501059868601211278405430937510894510108554655848141714335523840
14123616689535792874980573293180297225565526644800382147155122155300192495711607376723191652151431699456

Computed in your browser ?

Technical details
Node id
n-344833a32d1afc96 · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-4da4a97ce74eee20

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: 1;
  1: 1,   2;
  2: 1,  20,    3;
  3: 1,  38,   57,     4;
  4: 1,  56,  354,   112,      5;
  5: 1,  74,  894,  1192,    185,      6;
  6: 1,  92, 1677,  6160,   2795,    276,      7;
  7: 1, 110, 2703, 17932,  22415,   5406,    385,     8;
  8: 1, 128, 3972, 39424, 106430,  59136,   9268,   512,   9;
  9: 1, 146, 5484, 73552, 335030, 402036, 128716, 14624, 657, 10;
%F Formula
The row polynomials satisfy -(n+(9*n^2-2*n)*x-(9*n^2+17*n)*x^2)*P(n,x) = -(n+(9*n^2+34*n-34)*x+(153*n^2+127*n-292)*x^2-(18*n+34)*x^3)*P(n-1,x) + (x+(9*n+51)*x^2+(306*n+579)*x^3+(9*n+17)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(n + (9*n^2 + 34*n - 34)*x + (153*n^2 + 127*n - 292)*x^2 - (18*n + 34)*x^3)*P[n - 1, x] + (x + (9*n + 51)*x^2 + (306*n + 579)*x^3 + (9*n + 17)*x^4)*D[P[n - 1, x], x])/(-n - (9*n^2 - 2*n)*x + (9*n^2 + 17*n)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(n + (9*n^2 + 34*n - 34)*x + (153*n^2 + 127*n - 292)*x^2 - (18*n + 34)*x^3)*v[i - 1] + (x + (9*n + 51)*x^2 + (306*n + 579)*x^3 + (9*n + 17)*x^4)*deriv(v[i - 1], x))/(-n - (9*n^2 - 2*n)*x + (9*n^2 + 17*n)*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-bf7cc7e5e6b812c4
  • 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-bf7cc7e5e6b812c4
  • 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-bf7cc7e5e6b812c4
  • 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-bf7cc7e5e6b812c4

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. [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.