A159854 → x ↦ x+1 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
01438
121012428
24243924596
3856114100406324
4161283123522056071080
53228881611208503668483564
6646402064332831001752595112911664
712814085088940810360722432349041441037908
Technical details
Node id
n-98f16fdd4b44e5ec · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-31c7f065f4c4bbdd

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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,    4,     3;
  1:   2,   10,    12,     4;
  2:   4,   24,    39,    24,     5;
  3:   8,   56,   114,   100,    40,     6;
  4:  16,  128,   312,   352,   205,    60,     7;
  5:  32,  288,   816,  1120,   850,   366,    84,     8;
  6:  64,  640,  2064,  3328,  3100,  1752,   595,   112,    9;
  7: 128, 1408,  5088,  9408, 10360,  7224,  3234,   904,  144,   10;
  8: 256, 3072, 12288, 25600, 32480, 26880, 14896,  5504, 1305,  180,  11;
  9: 512, 6656, 29184, 67584, 96960, 92736, 61152, 28032, 8802, 1810, 220, 12;
%F Formula
The row polynomials satisfy (2+(n+6)*x+(n+2)*x^2)*P(n,x) = (4+(2*n+16)*x+(3*n+13)*x^2+(n+3)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 1 + 4*x + 3*x^2.
%t Mathematica
P[0, x_] := 1 + 4*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((4 + (2*n + 16)*x + (3*n + 13)*x^2 + (n + 3)*x^3)*P[n - 1, x])/(2 + (n + 6)*x + (n + 2)*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 + 4*x + 3*x^2; for(n = 1, N, my(i = n + 1); v[i] = ((4 + (2*n + 16)*x + (3*n + 13)*x^2 + (n + 3)*x^3)*v[i - 1])/(2 + (n + 6)*x + (n + 2)*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

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