A110552 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

\(P_{n}(x) = \left(-8 - 32\,x - 32\,x^{2}\right)\,P_{n-2}(x) + \left(6 + 12\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
13811
2105264126
3362726565121476
4136132847047232409617496
5528627229056660487398432768208656
62080289921651204940808217607219202621442496096
782561318408885763287040722432094494726819840209715229906496
83289659161645982722022092855121920955064321028177926293094416777216358598016
9131328262553623097344117555200381968384822542336117486387210740039685704908801342177284301496576
1052480011543552113319936654655488246728294463438520321127704166413692567552108728156165100535808107374182451607881216
112098176503521285454438403524198400151029350404510541414495845220352144970874880153020006400107379425280450982051848589934592619234108416
128390656218148864258414182418457640960885945139203012148592647441636392961346558754816177176051712016536200806401039405154304395141185536687194767367430446503936
1333558528939622400120806768649449648947250200674304019135117393925386131210240113391288975361785899306188820788103086080173863044382729895705313280343599061401654975581388889163181264896
141342259204026744832558371307524746126295042763905171456116697635225603685171907788888443765915648162146304393216226021357912064235847643299840178671948136448929091687546882968688105881643980465111041069945114484736
Technical details
Node id
n-6ed12f7325828d66 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-e48c611829f57832

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:      3,       8;
  2:     10,      52,       64;
  3:     36,     272,      656,       512;
  4:    136,    1328,     4704,      7232,      4096;
  5:    528,    6272,    29056,     66048,     73984,     32768;
  6:   2080,   28992,   165120,    494080,    821760,    721920,     262144;
  7:   8256,  131840,   888576,   3287040,   7224320,   9449472,    6819840,    2097152;
  8:  32896,  591616,  4598272,  20220928,  55121920,  95506432,  102817792,   62930944,  16777216;
  9: 131328, 2625536, 23097344, 117555200, 381968384, 822542336, 1174863872, 1074003968, 570490880, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = -(8+32*x+32*x^2)*P(n-2,x) + (6+12*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(8 + 32*x + 32*x^2)*P[n - 2, x] + (6 + 12*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] = 3 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(8 + 32*x + 32*x^2)*v[i - 2] + (6 + 12*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. [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