A035607 → basis A007318 → basis A013609

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(2 + 2\,x\right)\,P_{n-2}(x) + \left(3 + 2\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
011
111
2549
31724849
4611248016281
5217576552224321601
6773253232161968576649129
727531072816968138886176140812852049
8980544300838568596851392178563328256296761
9349211794723955604873283662401715204876876805121692001
1012437371646818019362592752234809613855365317121277441740810249647049
1144296128269367988808131479041393692899283204806784155955232409638912204855003249
121577629110484123465710464210704779882886512608038111488156111364381696801792860164096313604441
135618809428402881476996243042197444165559363990853122740568321357890564813465611894784194355218841681921788035201
1420011685165010564620190480140579409621425052802316596544182681625610629260804559677441423206403139584046325764096001638410194593769
Technical details
Node id
n-d1f35c497614c7c3 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-205a62c6b3f27a2b

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (irregular)
  • 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:     5,      4;
  3:    17,     24,      8;
  4:    61,    124,     80,     16;
  5:   217,    576,    552,    224,     32;
  6:   773,   2532,   3216,   1968,    576,     64;
  7:  2753,  10728,  16968,  13888,   6176,   1408,   128;
  8:  9805,  44300,  83856,  85968,  51392,  17856,  3328,  256;
  9: 34921, 179472, 395560, 487328, 366240, 171520, 48768, 7680, 512;
%F Formula
The row polynomials satisfy P(n,x) = (2+2*x)*P(n-2,x) + (3+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 2, x] + (3 + 2*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] = 1; for(n = 2, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 2] + (3 + 2*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

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