A084534 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
13811
27323271
318120240128506
447416128015365123791
512313605680108808960204829051
63224272225605964880640491528192224786
78431304883328281344532224544768258048327681746371
82207390402924801202176292864042434563440640131072013107213590431
957781149849885604789632142871042685542431137792206438406488064524288105835466
101512733448032454401811072063952640147955712224010240214302720118947840314572802097152824429351
1139603963248104112806575782426832256073770188813811015681735557120140142182466322432014994636883886086422836211
121036822751072327765122311377921070264832341033779276140216321188180787212671188992878916403235987128327046430723355443250040464546
1327144378026001015872007911654404098931200148567244803854888960071969996800956845260808809349120053230960640190840832003271557120134217728389874204731
14710647219988163107384002648826880151823257606169096192018247950336039694172160063326355456072948908032058778976256031297896448099237232640150323855365368709123037604638391
Technical details
Node id
n-8018092894e25502 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-261d320b22506b21

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:    3,      8;
  2:    7,     32,     32;
  3:   18,    120,    240,     128;
  4:   47,    416,   1280,    1536,      512;
  5:  123,   1360,   5680,   10880,     8960,     2048;
  6:  322,   4272,  22560,   59648,    80640,    49152,     8192;
  7:  843,  13048,  83328,  281344,   532224,   544768,   258048,    32768;
  8: 2207,  39040, 292480, 1202176,  2928640,  4243456,  3440640,  1310720,  131072;
  9: 5778, 114984, 988560, 4789632, 14287104, 26855424, 31137792, 20643840, 6488064, 524288;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = -(n-2+(8*n-16)*x+(16*n-32)*x^2)*P(n-2,x) + (3*n-6+(8*n-16)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 3 + 8*x, P(2,x) = 7 + 32*x + 32*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 8*x;
P[2, x_] := 7 + 32*x + 32*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 2 + (8*n - 16)*x + (16*n - 32)*x^2)*P[n - 2, x] + (3*n - 6 + (8*n - 16)*x)*P[n - 1, x])/(n - 2)]];
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 + 8*x; v[3] = 7 + 32*x + 32*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(n - 2 + (8*n - 16)*x + (16*n - 32)*x^2)*v[i - 2] + (3*n - 6 + (8*n - 16)*x)*v[i - 1])/(n - 2)); 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. [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