A132393 → basis A013611 → θ+1

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-1 + 8\,x - 16\,x^{2} + 2\,n - 8\,n x - n^{2}\right)\,P_{n-2}(x) + \left(-1 + 8\,x + 2\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1189
22244874
3688288256638
4244001680256012805944
51202192108002176019200614460216
6720141127795218816022400012902428672662640
750401045446303361732864250880019783688028161310727893840
Technical details
Node id
n-8924fa649071cd6f · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-f1c7076bf9a4c26f

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:      1,       8;
  2:      2,      24,       48;
  3:      6,      88,      288,       256;
  4:     24,     400,     1680,      2560,      1280;
  5:    120,    2192,    10800,     21760,     19200,      6144;
  6:    720,   14112,    77952,    188160,    224000,    129024,     28672;
  7:   5040,  104544,   630336,   1732864,   2508800,   1978368,    802816,    131072;
  8:  40320,  876672,  5669952,  17224704,  28734720,  27869184,  15654912,   4718592,   589824;
  9: 362880, 8212608, 56289600, 185262080, 344736000, 388749312, 270950400, 114032640, 26542080, 2621440;
%F Formula
The row polynomials satisfy P(n,x) = -(n^2-2*n+1+(8*n-8)*x+16*x^2)*P(n-2,x) + (2*n-1+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(n^2 - 2*n + 1 + (8*n - 8)*x + 16*x^2)*P[n - 2, x] + (2*n - 1 + 8*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] = 1 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 2*n + 1 + (8*n - 8)*x + 16*x^2)*v[i - 2] + (2*n - 1 + 8*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

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.