A207607 → basis A013609 → basis A013610

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
171219
23410272208
31637029724322269
4781438690007992259224751
537422591470344935286091215552269992
617929147636498204881712863136443232933122945161
7859038198403306492730425695450407379424312595255987232126779
841158644669822095329655478520906876009372412859812992215550723359232350449408
91972027239845861282618803958081207767640801005366816858283776466093440146126592201553923822816709
109448549127288110764263620269313336061679815209593694432102638067847458614784352383436897753651212093235241700534391
114527071866914725844567848801765544040046221943680839709944641080229167369840982118462224733952260105333766469880832725594112454883061592
12216905041349007248825534544328112324777920330874379280687592939968103367674368011327279915528980587624965024235340801882916720644244725555243535646724962013143121
1310392544871808264542814415637168869717571516822820986202405339239981056918591844147211767290598656112244370278407874459712000394952968396813412607160322764513566722612138803254127261512739
144979367394931586815748037431866804238492028048152626730129283970119868675276931355350016112819235650560125827869968640106216497192960668061150197763036103442841694254675148801789315080192156728328192590437863497008
Technical details
Node id
n-55e007b2094ebbb4 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-81cb68c2aa4ad43a

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:       7,       12;
  2:      34,      102,        72;
  3:     163,      702,       972,       432;
  4:     781,     4386,      9000,      7992,      2592;
  5:    3742,    25914,     70344,     93528,     60912,      15552;
  6:   17929,   147636,    498204,    881712,    863136,     443232,     93312;
  7:   85903,   819840,   3306492,   7304256,   9545040,    7379424,   3125952,    559872;
  8:  411586,  4466982,  20953296,  55478520,  90687600,   93724128,  59812992,  21555072,   3359232;
  9: 1972027, 23984586, 128261880, 395808120, 776764080, 1005366816, 858283776, 466093440, 146126592, 20155392;
%F Formula
The row polynomials satisfy P(n,x) = -P(n-2,x) + (5+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 12*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 7 + 12*x;
P[n_, x_] := P[n, x] = Expand[-P[n - 2, x] + (5 + 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] = 7 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = -v[i - 2] + (5 + 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