A086645 → basis A013610 → basis A013609

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-9 - 36\,x - 36\,x^{2}\right)\,P_{n-2}(x) + \left(10 + 12\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 5 + 6\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
25611
3418436161
436510989722162651
5328113128180729504129645281
629525147630276840235440842407776781451
726572115943323786588446774426632806998404665613524161
8239148516740402481287247271661661045488273792965552064279936234234011
Technical details
Node id
n-64da3d3996fd8bc9 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-68a9b3ef133d850f

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:         5,          6;
   3:        41,         84,         36;
   4:       365,       1098,        972,         216;
   5:      3281,      13128,      18072,        9504,        1296;
   6:     29525,     147630,     276840,      235440,       84240,        7776;
   7:    265721,    1594332,    3786588,     4467744,     2663280,      699840,      46656;
   8:   2391485,   16740402,   48128724,    72716616,    61045488,    27379296,    5552064,     279936;
   9:  21523361,  172186896,  581130864,  1070788032,  1161928800,   743323392,  262579968,   42550272,   1679616;
  10: 193710245, 1743392214, 6755644944, 14691712608, 19568902752, 16314530112, 8312419584, 2388413952, 317447424, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = -(9+36*x+36*x^2)*P(n-2,x) + (10+12*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 5 + 6*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 5 + 6*x;
P[n_, x_] := P[n, x] = Expand[-(9 + 36*x + 36*x^2)*P[n - 2, x] + (10 + 12*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] = 5 + 6*x; for(n = 3, N, my(i = n); v[i] = -(9 + 36*x + 36*x^2)*v[i - 2] + (10 + 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, 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