A201701: Riordan triangle ((1-x)/(1-2*x), x^2/(1-2*x)).

A201701 ↗ nonnegative coefficients

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

Recurrence from A201701

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

Rows ?

nx0x1x2x3Pn(1)
011
111
2213
3437
488117
51620541
6324818199
764112567239
Technical details
Node id
n-495335f6a4ca3289 · revision 0 · JSON
Definition source
oeis_catalog:A201701
Fingerprint
f6-702b8764f2c773f5

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 ?

Row sums ? A078057, A001333

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   1;
  2:   2,   1;
  3:   4,   3;
  4:   8,   8,   1;
  5:  16,  20,   5;
  6:  32,  48,  18,   1;
  7:  64, 112,  56,   7;
  8: 128, 256, 160,  32, 1;
  9: 256, 576, 432, 120, 9;
%F Formula
The row polynomials satisfy P(n,x) = 2*P(n-1,x) + x*P(n-2,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*P[n - 1, x] + 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] = 1; for(n = 2, N, my(i = n + 1); v[i] = 2*v[i - 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

A207537 triangle, offset 1, from P1
%e Example
Triangle begins:
   1:   1;
   2:   2,    1;
   3:   4,    3;
   4:   8,    8,    1;
   5:  16,   20,    5;
   6:  32,   48,   18,   1;
   7:  64,  112,   56,   7;
   8: 128,  256,  160,  32,  1;
   9: 256,  576,  432, 120,  9;
  10: 512, 1280, 1120, 400, 50, 1;
%F Formula
The row polynomials satisfy P(n,x) = 2*P(n-1,x) + x*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] + 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] = 2 + x; for(n = 3, N, my(i = n); v[i] = 2*v[i - 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

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