A011973 → x ↦ x+2 (shift +1) → D+1

nonnegative coefficients

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

Recurrence
\(\left(6 + 11\,x + 4\,x^{2} + 14\,n + 15\,n x + 4\,n x^{2} + 9\,n^{2} + 4\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(6 + 11\,x + 4\,x^{2} + 67\,n + 101\,n x + 50\,n x^{2} + 8\,n x^{3} + 42\,n^{2} + 36\,n^{2} x + 8\,n^{2} x^{2} + 5\,n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(-414 - 733\,x - 487\,x^{2} - 144\,x^{3} - 16\,x^{4} - 180\,n - 242\,n x - 108\,n x^{2} - 16\,n x^{3} - 18\,n^{2} - 17\,n^{2} x - 4\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1415
2729
3189128
43722362
58465151165
6179162464391
7390417153221983
883310144418052373
91784245712632953015830
10379158103420956125614108
118042136099081300450539134281
1216989314462342389121806182782765
13358047201759343256456160798491199817
1475243163426147594713801979031082528480801

Computed in your browser ?

Technical details
Node id
n-f2b038a33436dda1 · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-6f025d7ab02f4150

Observed on the stored rows ?

  • Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    1;
  1:    4,    1;
  2:    7,    2;
  3:   18,    9,    1;
  4:   37,   22,    3;
  5:   84,   65,   15,   1;
  6:  179,  162,   46,   4;
  7:  390,  417,  153,  22,  1;
  8:  833, 1014,  441,  80,  5;
  9: 1784, 2457, 1263, 295, 30, 1;
%F Formula
The row polynomials satisfy (n^3+9*n^2+14*n+6+(4*n^2+15*n+11)*x+(4*n+4)*x^2)*P(n,x) = (5*n^3+42*n^2+67*n+6+(2*n^3+36*n^2+101*n+11)*x+(8*n^2+50*n+4)*x^2+8*n*x^3)*P(n-1,x) - (18*n^2+180*n+414+(17*n^2+242*n+733)*x+(4*n^2+108*n+487)*x^2+(16*n+144)*x^3+16*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[((5*n^3 + 42*n^2 + 67*n + 6 + (2*n^3 + 36*n^2 + 101*n + 11)*x + (8*n^2 + 50*n + 4)*x^2 + 8*n*x^3)*P[n - 1, x] - (18*n^2 + 180*n + 414 + (17*n^2 + 242*n + 733)*x + (4*n^2 + 108*n + 487)*x^2 + (16*n + 144)*x^3 + 16*x^4)*D[P[n - 1, x], x])/(n^3 + 9*n^2 + 14*n + 6 + (4*n^2 + 15*n + 11)*x + (4*n + 4)*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] = ((5*n^3 + 42*n^2 + 67*n + 6 + (2*n^3 + 36*n^2 + 101*n + 11)*x + (8*n^2 + 50*n + 4)*x^2 + 8*n*x^3)*v[i - 1] - (18*n^2 + 180*n + 414 + (17*n^2 + 242*n + 733)*x + (4*n^2 + 108*n + 487)*x^2 + (16*n + 144)*x^3 + 16*x^4)*deriv(v[i - 1], x))/(n^3 + 9*n^2 + 14*n + 6 + (4*n^2 + 15*n + 11)*x + (4*n + 4)*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-14d41bb220ff7187
  • 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-14d41bb220ff7187
  • 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-14d41bb220ff7187

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. [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
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.