A257612 → 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(2 + 8\,x + 10\,x^{2} + 4\,x^{3}\right)\,P_{n-1}(x) + \left(4\,x + 12\,x^{2} + 12\,x^{3} + 4\,x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1246
24323268
382085763841176
4161280742412288614427152
532774484480261120307200122880783456
66446592906752466944097075208847360294912027126848
7128279808944025676253184249446400388792320289013760825753601095801216
Technical details
Node id
n-9b0cf606b905d184 · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-2a2e8db5a042c827

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   2,        4;
  2:   4,       32,        32;
  3:   8,      208,       576,         384;
  4:  16,     1280,      7424,       12288,         6144;
  5:  32,     7744,     84480,      261120,       307200,       122880;
  6:  64,    46592,    906752,     4669440,      9707520,      8847360,      2949120;
  7: 128,   279808,   9440256,    76253184,    249446400,    388792320,    289013760,     82575360;
  8: 256,  1679360,  96641024,  1180827648,   5710086144,  13542359040,  16845373440,  10569646080,   2642411520;
  9: 512, 10077184, 979845120, 17691279360, 121674792960, 412133621760, 762996326400, 788759838720, 428070666240, 95126814720;
%F Formula
The row polynomials satisfy (1+2*x+x^2)*P(n,x) = (2+8*x+10*x^2+4*x^3)*P(n-1,x) + (4*x+12*x^2+12*x^3+4*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[((2 + 8*x + 10*x^2 + 4*x^3)*P[n - 1, x] + (4*x + 12*x^2 + 12*x^3 + 4*x^4)*D[P[n - 1, x], 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; for(n = 1, N, my(i = n + 1); v[i] = ((2 + 8*x + 10*x^2 + 4*x^3)*v[i - 1] + (4*x + 12*x^2 + 12*x^3 + 4*x^4)*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 - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

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