A123097 → basis A013609

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(-2 + n\right)\,P_{n}(x) = \left(8 + 16\,x + 8\,x^{2} - 4\,n - 8\,n x - 4\,n x^{2}\right)\,P_{n-2}(x) + \left(-8 - 8\,x + 4\,n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + 4\,x\)
\(P_{2}(x) = 14 + 26\,x + 12\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1549
214261252
33610410032272
488344504328801344
52081024201619849761926400
64802848704092806880272044829696
7108875522246437120368002188872321024135168
82432193286720013350416576013171265408185602304606208
95376481281914884444166630406594564372481863684633651202686976
1011776117248525312139468824299522903040240844813701125114881131521126411796480
112560028057613977604177920832512011612160115691528232960410112013619202713602457651380224
1255296661504362700812052480270336004311859250147328428482562669568011827200353689664102453248222298112
13118784154009692160003370188884029440150847488200589312200048640149630976829030403307110489948161495040114688956301312
1425395235471362300313691799552251863040502554624752074752857505792748560384497868800248348672900956162247065634488322457604093640704
Technical details
Node id
n-3d01f9226121973c · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-36dd966291f10a09

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    1;
  1:    5,     4;
  2:   14,    26,     12;
  3:   36,   104,    100,     32;
  4:   88,   344,    504,    328,     80;
  5:  208,  1024,   2016,   1984,    976,    192;
  6:  480,  2848,   7040,   9280,   6880,   2720,    448;
  7: 1088,  7552,  22464,  37120,  36800,  21888,   7232,   1024;
  8: 2432, 19328,  67200, 133504, 165760, 131712,  65408,  18560,  2304;
  9: 5376, 48128, 191488, 444416, 663040, 659456, 437248, 186368, 46336, 5120;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = -(4*n-8+(8*n-16)*x+(4*n-8)*x^2)*P(n-2,x) + (4*n-8+(4*n-8)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 5 + 4*x, P(2,x) = 14 + 26*x + 12*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 5 + 4*x;
P[2, x_] := 14 + 26*x + 12*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n - 8 + (8*n - 16)*x + (4*n - 8)*x^2)*P[n - 2, x] + (4*n - 8 + (4*n - 8)*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] = 5 + 4*x; v[3] = 14 + 26*x + 12*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(4*n - 8 + (8*n - 16)*x + (4*n - 8)*x^2)*v[i - 2] + (4*n - 8 + (4*n - 8)*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

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