A137320 → basis A013609 → θ+1

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-16\,x^{2} - 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) = 2 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
12810
26404894
324208432256920
412012323408358412809624
572083522784039680256006144108336
6504064224244992426240377600165888286721312656
7403205541122345280471654451520003139584100352013107217082432
Technical details
Node id
n-815563081cf14159 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-27be97c9d1c44c83

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,        8;
  2:       6,       40,        48;
  3:      24,      208,       432,       256;
  4:     120,     1232,      3408,      3584,      1280;
  5:     720,     8352,     27840,     39680,     25600,      6144;
  6:    5040,    64224,    244992,    426240,    377600,    165888,     28672;
  7:   40320,   554112,   2345280,   4716544,   5152000,   3139584,   1003520,    131072;
  8:  362880,  5309568,  24432192,  54957056,  69950720,  52985856,  23683072,   5767168,   589824;
  9: 3628800, 55998720, 276179328, 679875584, 974292480, 865622016, 484098048, 165937152, 31850496, 2621440;
%F Formula
The row polynomials satisfy P(n,x) = -(n^2+8*n*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) = 2 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(n^2 + 8*n*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] = 2 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 8*n*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. [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.