A376827 → x ↦ x/(x+1)

nonnegative coefficientsonly rational roots

Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel

Recurrence

\(\left(n + 2\,n x + n x^{2}\right)\,P_{n}(x) = \left(-3 - 18\,x - 39\,x^{2} - 36\,x^{3} - 12\,x^{4} + 3\,n + 18\,n x + 39\,n x^{2} + 36\,n x^{3} + 12\,n x^{4}\right)\,P_{n-2}(x) + \left(-1 - 4\,x - 5\,x^{2} - 2\,x^{3} + 2\,n + 8\,n x + 10\,n x^{2} + 4\,n x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 2\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1123
23121227
37428456189
4191524566083041539
551510204040804080163212393
6141169284602256033840270729024102789
739355023301211004022008026409617606450304859491
Technical details
Node id
n-0b806d8871f729f4 · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-11aec07ce60b6d61

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    1;
  1:    1,     2;
  2:    3,    12,     12;
  3:    7,    42,     84,      56;
  4:   19,   152,    456,     608,     304;
  5:   51,   510,   2040,    4080,    4080,     1632;
  6:  141,  1692,   8460,   22560,   33840,    27072,     9024;
  7:  393,  5502,  33012,  110040,  220080,   264096,   176064,    50304;
  8: 1107, 17712, 123984,  495936, 1239840,  1983744,  1983744,  1133568,  283392;
  9: 3139, 56502, 452016, 2109408, 6328224, 12656448, 16875264, 14464512, 7232256, 1607168;
%F Formula
The row polynomials satisfy (n+2*n*x+n*x^2)*P(n,x) = (3*n-3+(18*n-18)*x+(39*n-39)*x^2+(36*n-36)*x^3+(12*n-12)*x^4)*P(n-2,x) + (2*n-1+(8*n-4)*x+(10*n-5)*x^2+(4*n-2)*x^3)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((3*n - 3 + (18*n - 18)*x + (39*n - 39)*x^2 + (36*n - 36)*x^3 + (12*n - 12)*x^4)*P[n - 2, x] + (2*n - 1 + (8*n - 4)*x + (10*n - 5)*x^2 + (4*n - 2)*x^3)*P[n - 1, x])/(n + 2*n*x + 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; v[2] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((3*n - 3 + (18*n - 18)*x + (39*n - 39)*x^2 + (36*n - 36)*x^3 + (12*n - 12)*x^4)*v[i - 2] + (2*n - 1 + (8*n - 4)*x + (10*n - 5)*x^2 + (4*n - 2)*x^3)*v[i - 1])/(n + 2*n*x + 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)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

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