A269939 → x ↦ x/(x+1)

nonnegative coefficients

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

Recurrence

\(\left(1 + 2\,x + x^{2}\right)\,P_{n}(x) = \left(x + 6\,x^{2} + 9\,x^{3} + 4\,x^{4} - 2\,n x^{2} - 4\,n x^{3} - 2\,n x^{4}\right)\,P_{n-1}(x) + \left(x + 5\,x^{2} + 9\,x^{3} + 7\,x^{4} + 2\,x^{5}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2011
30145
401122639
50128158236423
60160664241227525889
7011242404159284246039208100125
8012528070867604049408508966600322010951
Technical details
Node id
n-48961ea899e72d99 · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-11f5029b9713167f

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1;
   2: 0, 1;
   3: 0, 1,    4;
   4: 0, 1,   12,    26;
   5: 0, 1,   28,   158,     236;
   6: 0, 1,   60,   664,    2412,     2752;
   7: 0, 1,  124,  2404,   15928,    42460,     39208;
   8: 0, 1,  252,  8070,   86760,   404940,    850896,    660032;
   9: 0, 1,  508, 25962,  425220,  3088020,  11063856,  19167488,  12818912;
  10: 0, 1, 1020, 81428, 1954404, 20708340, 112389696, 325857560, 479980608, 282137824;
%F Formula
The row polynomials satisfy (1+2*x+x^2)*P(n,x) = (x-(2*n-6)*x^2-(4*n-9)*x^3-(2*n-4)*x^4)*P(n-1,x) + (x+5*x^2+9*x^3+7*x^4+2*x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((x - (2*n - 6)*x^2 - (4*n - 9)*x^3 - (2*n - 4)*x^4)*P[n - 1, x] + (x + 5*x^2 + 9*x^3 + 7*x^4 + 2*x^5)*D[P[n - 1, x], x])/(1 + 2*x + x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((x - (2*n - 6)*x^2 - (4*n - 9)*x^3 - (2*n - 4)*x^4)*v[i - 1] + (x + 5*x^2 + 9*x^3 + 7*x^4 + 2*x^5)*deriv(v[i - 1], x))/(1 + 2*x + x^2)); 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)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [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
  3. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.