A111049 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(-2 + n\right)\,P_{n}(x) = \left(16 + 64\,x + 64\,x^{2} - 8\,n - 32\,n x - 32\,n x^{2}\right)\,P_{n-2}(x) + \left(-12 - 24\,x + 6\,n + 12\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 4\,x\)
\(P_{2}(x) = 6 + 28\,x + 32\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1246
26283266
320144336256756
4726882400364820488856
5272320014720332803712016384104976
6105614656832002483204121603614721310721251936
74160663044462081648640361984047308803411968104857614976576
816512296704230451210128384275968004779622451437568314736648388608179438976
96579213148161156300858834944191127552411500544587661312537133056285278208671088642151588096
1026265657763845669683232749977612341575683172958208563989708868474634245436997632255039897653687091225808979456
11104960025186304272814080176259072075531878402255683584047929491456724933017607651590144053692334080225496268804294967296309647287296
1241963521090969601292296192923017216044302663680150622568448372112097280673322631168885923512320826838876160519714111488197572689920343597383683715404650496
13167813124698603526040879104472518492162510195916809568077742082693186715648566977206681689297560535041039428222976086932906311684947902988288171800369561627487790694444582679023616
1467117056201347891227919843328237315686400138199944396858350504509441842630937804844222782636032810745017139201130121784197121179250212208648933662837964846454802481152148434740838402199023255552534979087589376
Technical details
Node id
n-464e94f76b144d64 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-4758fffc3cabc65e

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:     2,       4;
  2:     6,      28,       32;
  3:    20,     144,      336,      256;
  4:    72,     688,     2400,     3648,      2048;
  5:   272,    3200,    14720,    33280,     37120,     16384;
  6:  1056,   14656,    83200,   248320,    412160,    361472,    131072;
  7:  4160,   66304,   446208,  1648640,   3619840,   4730880,   3411968,   1048576;
  8: 16512,  296704,  2304512, 10128384,  27596800,  47796224,  51437568,  31473664,   8388608;
  9: 65792, 1314816, 11563008, 58834944, 191127552, 411500544, 587661312, 537133056, 285278208, 67108864;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = -(8*n-16+(32*n-64)*x+(32*n-64)*x^2)*P(n-2,x) + (6*n-12+(12*n-24)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 4*x, P(2,x) = 6 + 28*x + 32*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[2, x_] := 6 + 28*x + 32*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(8*n - 16 + (32*n - 64)*x + (32*n - 64)*x^2)*P[n - 2, x] + (6*n - 12 + (12*n - 24)*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] = 2 + 4*x; v[3] = 6 + 28*x + 32*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(8*n - 16 + (32*n - 64)*x + (32*n - 64)*x^2)*v[i - 2] + (6*n - 12 + (12*n - 24)*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