A136124 → basis A013609 → D+1

nonnegative coefficients

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1527
22622452
3154190728424
410441636908208163812
58028149081058035605603237668
6692641463361238565356012400144064406920
7663696155376015046087799122329603987235841284778520
Technical details
Node id
n-e32925c93adfd4e5 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-63d3ba3e2338ec7f

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:        5,         2;
  2:       26,        22,         4;
  3:      154,       190,        72,         8;
  4:     1044,      1636,       908,       208,       16;
  5:     8028,     14908,     10580,      3560,      560,       32;
  6:    69264,    146336,    123856,     53560,    12400,     1440,      64;
  7:   663696,   1553760,   1504608,    779912,   232960,    39872,    3584,    128;
  8:  6999840,  17829504,  19225104,  11454240,  4117904,   912128,  120960,   8704,   256;
  9: 80627040, 220495104, 259779216, 173048896, 71782032, 19201056, 3303552, 350976, 20736, 512;
%F Formula
The row polynomials satisfy P(n,x) = -(n^2+2*n+1+(4*n+4)*x+4*x^2)*P(n-2,x) + (2*n+3+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 5 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(n^2 + 2*n + 1 + (4*n + 4)*x + 4*x^2)*P[n - 2, x] + (2*n + 3 + 4*x)*P[n - 1, x]];
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] = 5 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 2*n + 1 + (4*n + 4)*x + 4*x^2)*v[i - 2] + (2*n + 3 + 4*x)*v[i - 1]); 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. [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. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.