A207607 → 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(-1\right)\,P_{n-2}(x) + \left(6 + 6\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 9 + 12\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
191221
25312672251
3309106211884322991
418018100134289720259235641
510497583441279801384567387215552424701
661181404946110451615888961271376536544933125060771
735658927384188928792160220161708776010831968377913655987260304551
Technical details
Node id
n-5eab08a2d01868db · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-661b2d16864d9743

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:        9,        12;
  2:       53,       126,        72;
  3:      309,      1062,      1188,        432;
  4:     1801,      8100,     13428,       9720,       2592;
  5:    10497,     58344,    127980,     138456,      73872,      15552;
  6:    61181,    404946,   1104516,    1588896,    1271376,     536544,      93312;
  7:   356589,   2738418,   8928792,   16022016,   17087760,   10831968,    3779136,    559872;
  8:  2078353,  18165096,  68898744,  148115952,  197387280,  166981824,   87573312,  26034048,   3359232;
  9: 12113529, 118722276, 513454248, 1286066160, 2055931632, 2175382656, 1523551680, 681084288, 176359680, 20155392;
%F Formula
The row polynomials satisfy P(n,x) = -P(n-2,x) + (6+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 9 + 12*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 9 + 12*x;
P[n_, x_] := P[n, x] = Expand[-P[n - 2, x] + (6 + 6*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] = 9 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = -v[i - 2] + (6 + 6*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. [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