Real-rooted atlas

A304236 → basis A007318 → basis A013609

nonnegative coefficients

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

Recurrence

\(\left(n\right)\,P_{n}(x) = \left(-12 - 12\,x + 13\,n + 12\,n x\right)\,P_{n-1}(x) + \left(-25 - 49\,x - 24\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
111
27613
3131225
4559036181
5133240108481
646311108642162653
71261334829528648425
8403912786147967344129640261
9116054044052596302406480141361
1035839141390218088163080583207776624493
11105469453660776304660096278640466562320825
123205031517034293317229471041607040443232466569814741
13953317487180810312956115655047239456239500832659237664641
14287633515897030370141924684716034564320146966403265920279936155441533

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

\(P_{n}(x) = \left(6 + 6\,x\right)\,P_{n-2}(x) + \left(1\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Technical details
Node id
n-3f9fff45963528a2 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-8e47241937c3e0e7)
Fingerprint
f6-ba46f4556b8fa9cf

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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:     1;
  2:     7,     6;
  3:    13,    12;
  4:    55,    90,    36;
  5:   133,   240,   108;
  6:   463,  1110,   864,   216;
  7:  1261,  3348,  2952,   864;
  8:  4039, 12786, 14796,  7344, 1296;
  9: 11605, 40440, 52596, 30240, 6480;
%F Formula
The row polynomials satisfy n*P(n,x) = (13*n-12+(12*n-12)*x)*P(n-1,x) - (25+49*x+24*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((13*n - 12 + (12*n - 12)*x)*P[n - 1, x] - (25 + 49*x + 24*x^2)*D[P[n - 1, x], x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((13*n - 12 + (12*n - 12)*x)*v[i - 1] - (25 + 49*x + 24*x^2)*deriv(v[i - 1], x))/(n)); 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. [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