A208509: Triangle of coefficients of polynomials v(n,x) jointly generated with A208508; see the Formula section.

A208509 ↗ nonnegative coefficients

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

Recurrence from A208509

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

Rows ?

nx0x1x2x3Pn(1)
011
133
2516
37512
4914124
51130748
6135527196
71591779192
Technical details
Node id
n-d4c5acf24bc40277 · revision 0 · JSON
Definition source
oeis_catalog:A208509
Fingerprint
f6-930ba27ff87052d7

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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 ?

  • A208509 triangle 60 terms, 14 rows · tabf · nonn · catalog b-file?

Row sums ? A122391, A003945, A167881, A168728, A168680, A168824, A167648, A168776

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  1;
  1:  3;
  2:  5,   1;
  3:  7,   5;
  4:  9,  14,   1;
  5: 11,  30,   7;
  6: 13,  55,  27,   1;
  7: 15,  91,  77,   9;
  8: 17, 140, 182,  44,  1;
  9: 19, 204, 378, 156, 11;
%F Formula
The row polynomials satisfy P(n,x) = 2*P(n-1,x) - (1-x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3;
P[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - (1 - x)*P[n - 2, 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; for(n = 2, N, my(i = n + 1); v[i] = 2*v[i - 1] - (1 - x)*v[i - 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

A208509 triangle, offset 1, from P0
%e Example
Triangle begins:
   1:  1;
   2:  3;
   3:  5,   1;
   4:  7,   5;
   5:  9,  14,   1;
   6: 11,  30,   7;
   7: 13,  55,  27,   1;
   8: 15,  91,  77,   9;
   9: 17, 140, 182,  44,  1;
  10: 19, 204, 378, 156, 11;
%F Formula
The row polynomials satisfy P(n,x) = 2*P(n-1,x) - (1-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 3;
P[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - (1 - x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3; for(n = 3, N, my(i = n); v[i] = 2*v[i - 1] - (1 - x)*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Used in 10

2 more

References

  1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [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