A286718 → 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(-16 + 32\,x - 16\,x^{2} + 24\,n - 24\,n x - 9\,n^{2}\right)\,P_{n-2}(x) + \left(-5 + 8\,x + 6\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
12810
2105648114
3805287202561584
48806448110886656128026352
51232097312193920152320512006144513216
620944017528643880512362368016320003502082867211477376
7418880036732800881274249316966450758400148377602207744131072290153664
Technical details
Node id
n-2bdd7a547ec2a9a5 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-08e95044b92429c2

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:         10,          56,          48;
  3:         80,         528,         720,         256;
  4:        880,        6448,       11088,        6656,        1280;
  5:      12320,       97312,      193920,      152320,       51200,        6144;
  6:     209440,     1752864,     3880512,     3623680,     1632000,      350208,      28672;
  7:    4188800,    36732800,    88127424,    93169664,    50758400,    14837760,    2207744,    131072;
  8:   96342400,   878364800,  2247327552,  2612915200,  1633291520,   584908800,  120020992,  13107200,   589824;
  9: 2504902400, 23608224000, 63700705152, 79921542144, 55530155520, 23047428096, 5850120192, 889454592, 74317824, 2621440;
%F Formula
The row polynomials satisfy P(n,x) = -(9*n^2-24*n+16+(24*n-32)*x+16*x^2)*P(n-2,x) + (6*n-5+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[-(9*n^2 - 24*n + 16 + (24*n - 32)*x + 16*x^2)*P[n - 2, x] + (6*n - 5 + 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] = -(9*n^2 - 24*n + 16 + (24*n - 32)*x + 16*x^2)*v[i - 2] + (6*n - 5 + 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.