A236076 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
247314
382118552
4165570398188
5321372321948013688
664327690769477156212504
71287611924268022201093296349136
82561735511085398851582523765495533296
9512389713104255423179426202142924974100289121408
101024864732682727891057651047387157233317101091805144442592
1120481900179740199764331872383831315294183915746442007232182331613632
12409641415191070531775994215131526312622488852974503001619703910256883775882816
13819289657451016138059428687664272520469146438450882351924106026134236874982998261021447424
141638419296710511543509785802418513286232164284841540915311015751597232224170437080021418841741198778191744
Technical details
Node id
n-fb2c8b0ba28661fd · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-f9ff5861407dbab6

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   2,    2;
  2:   4,    7,     3;
  3:   8,   21,    18,     5;
  4:  16,   55,    70,    39,     8;
  5:  32,  137,   232,   194,    80,    13;
  6:  64,  327,   690,   769,   477,   156,    21;
  7: 128,  761,  1924,  2680,  2220,  1093,   296,   34;
  8: 256, 1735,  5110,  8539,  8851,  5825,  2376,  549,   55;
  9: 512, 3897, 13104, 25542, 31794, 26202, 14292, 4974, 1002, 89;
%F Formula
The row polynomials satisfy P(n,x) = (2+3*x+x^2)*P(n-2,x) + (1+x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[(2 + 3*x + x^2)*P[n - 2, x] + (1 + 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] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 3*x + x^2)*v[i - 2] + (1 + 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