A104029 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1314
297117
3273412174
48114283181325
52435474511652511432
67292005214211172903316317
72187710893416357237346942127878
86561246043841032328158434536714521123049
91968383653151314151930924973494780221038631543148
1059049280483576959673530490925231317703891336214557512397545
11177147930022214421828546532426165137285652278613209921219198088110583234
12531441305578678055411167509811343642750349834408131091398234234324062629102146716589
13159432399645192793386946384839507380923844956020657157790970721369923963964790534191171206216896
1447829693228504198549092179909391218860285187057906115351173518530111694967339682506450736888743681331910285253
Technical details
Node id
n-fdc0c7cc2fd52cf9 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-f2b7ac8f0752ccba

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:     3,     1;
  2:     9,     7,      1;
  3:    27,    34,     12,      1;
  4:    81,   142,     83,     18,     1;
  5:   243,   547,    451,    165,    25,     1;
  6:   729,  2005,   2142,   1117,   290,    33,    1;
  7:  2187,  7108,   9341,   6357,  2373,   469,   42,    1;
  8:  6561, 24604,  38410,  32328, 15843,  4536,  714,   52,  1;
  9: 19683, 83653, 151314, 151930, 92497, 34947, 8022, 1038, 63, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(3+3*x+x^2)*P(n-2,x) + (4+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + x;
P[n_, x_] := P[n, x] = Expand[-(3 + 3*x + x^2)*P[n - 2, x] + (4 + 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] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 3*x + x^2)*v[i - 2] + (4 + 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