A134346 → 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(1 + 2\,x + x^{2}\right)\,P_{n}(x) = \left(-2 - 12\,x - 26\,x^{2} - 24\,x^{3} - 8\,x^{4}\right)\,P_{n-2}(x) + \left(3 + 12\,x + 15\,x^{2} + 6\,x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 6\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1369
27282863
31590180120405
4312487449924962511
563630252050405040201615309
612715247620203203048024384812892583
72553570214207140014280017136011424032640557685
Technical details
Node id
n-f69fa95c3f9b63e6 · 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:    3,     6;
  2:    7,    28,     28;
  3:   15,    90,    180,    120;
  4:   31,   248,    744,    992,     496;
  5:   63,   630,   2520,   5040,    5040,    2016;
  6:  127,  1524,   7620,  20320,   30480,   24384,    8128;
  7:  255,  3570,  21420,  71400,  142800,  171360,  114240,   32640;
  8:  511,  8176,  57232, 228928,  572320,  915712,  915712,  523264,  130816;
  9: 1023, 18414, 147312, 687456, 2062368, 4124736, 5499648, 4713984, 2356992, 523776;
%F Formula
The row polynomials satisfy (1+2*x+x^2)*P(n,x) = -(2+12*x+26*x^2+24*x^3+8*x^4)*P(n-2,x) + (3+12*x+15*x^2+6*x^3)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 6*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(2 + 12*x + 26*x^2 + 24*x^3 + 8*x^4)*P[n - 2, x] + (3 + 12*x + 15*x^2 + 6*x^3)*P[n - 1, x])/(1 + 2*x + 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] = 3 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (-(2 + 12*x + 26*x^2 + 24*x^3 + 8*x^4)*v[i - 2] + (3 + 12*x + 15*x^2 + 6*x^3)*v[i - 1])/(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 - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

Candidate equalities ?

Same fingerprint ?

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