A131436 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
131215
2756112175
3151807209601875
43149629767936793619375
563126010080403208064064512196875
61273048304801625604876807802885201921984375
7255714085680571200228480054835207311360417792019921875
Technical details
Node id
n-7514099f2f191994 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-03d7b8417365c509

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    1;
  1:    3,    12;
  2:    7,    56,    112;
  3:   15,   180,    720,     960;
  4:   31,   496,   2976,    7936,     7936;
  5:   63,  1260,  10080,   40320,    80640,     64512;
  6:  127,  3048,  30480,  162560,   487680,    780288,    520192;
  7:  255,  7140,  85680,  571200,  2284800,   5483520,   7311360,   4177920;
  8:  511, 16352, 228928, 1831424,  9157120,  29302784,  58605568,  66977792,  33488896;
  9: 1023, 36828, 589248, 5499648, 32997888, 131991552, 351977472, 603389952, 603389952, 268173312;
%F Formula
The row polynomials satisfy P(n,x) = -(2+16*x+32*x^2)*P(n-2,x) + (3+12*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 12*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 12*x;
P[n_, x_] := P[n, x] = Expand[-(2 + 16*x + 32*x^2)*P[n - 2, x] + (3 + 12*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] = 3 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = -(2 + 16*x + 32*x^2)*v[i - 2] + (3 + 12*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. [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