A046716 → x ↦ x+1 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2347
311281655
45320022464541
53451784315220482567585
62947199325057657408253441024157231
7314112665649024961524288128614443724840964452247
8400437411668817591024399876485099750434601984977305616384157484725
Technical details
Node id
n-4fd88d6afcec7815 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-c8e72bf234dd84dd

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:        1;
   2:        3,          4;
   3:       11,         28,         16;
   4:       53,        200,        224,          64;
   5:      345,       1784,       3152,        2048,         256;
   6:     2947,      19932,      50576,       57408,       25344,        1024;
   7:    31411,     266564,     902496,     1524288,     1286144,      437248,        4096;
   8:   400437,    4116688,   17591024,    39987648,    50997504,    34601984,     9773056,       16384;
   9:  5927921,   71815856,  372138336,  1069088000,  1838750464,  1893142528,  1080270848,   263585792,      65536;
  10: 99816515, 1394916468, 8514894432, 29651460224, 64421436672, 89411361792, 77408804864, 38217351168, 8237285376, 262144;
%F Formula
The row polynomials satisfy P(n,x) = -(4*n-8+(16*n-32)*x+(16*n-32)*x^2)*P(n-2,x) + (2*n-1+(4*n-4)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + 4*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(4*n - 8 + (16*n - 32)*x + (16*n - 32)*x^2)*P[n - 2, x] + (2*n - 1 + (4*n - 4)*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + 4*x; for(n = 3, N, my(i = n); v[i] = -(4*n - 8 + (16*n - 32)*x + (16*n - 32)*x^2)*v[i - 2] + (2*n - 1 + (4*n - 4)*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, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  2. [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
  3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023