A200139: Triangle T(n,k), read by rows, given by (1,1,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.

A200139 ↗ nonnegative coefficientsonly rational roots

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

Recurrence from A200139

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2112
32316
4485118
5820187154
61648563291162
73211216012050111486
864256432400220721311458
912857611201232840364981514374
102561280281635842912156856012817113122
1151228166912998494086048268881616219139366
1210246144166402688028800215041142443201140200211118098
1320481331239424704008448071808443522006466001540242231354294
14409628672921601802242393602280961605128448033264968020242882511062882
15819261440212992452608658944695552549120329472151008526241372826003382713188646
Technical details
Node id
n-f2a2a3d7ea29bcbf · revision 1 · JSON
Definition source
oeis_catalog:A200139
Fingerprint
f6-04668acf2e74f66d

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 -1)
  • 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 ℚ): yes

Matches ?

  • A081277 reversed triangle 64 terms, 10 rows · tabl · nonn b-file?
  • A200139 triangle 66 terms, 11 rows · tabl · nonn · catalog b-file?

Row sums ? A110593, A099856, A025192, A027334, A008776

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:   1;
   2:   1,    1;
   3:   2,    3,    1;
   4:   4,    8,    5,    1;
   5:   8,   20,   18,    7,    1;
   6:  16,   48,   56,   32,    9,    1;
   7:  32,  112,  160,  120,   50,   11,   1;
   8:  64,  256,  432,  400,  220,   72,  13,   1;
   9: 128,  576, 1120, 1232,  840,  364,  98,  15,  1;
  10: 256, 1280, 2816, 3584, 2912, 1568, 560, 128, 17, 1;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (2*n-4+(n-2)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 4 + (n - 2)*x)*P[n - 1, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + x; for(n = 3, N, my(i = n); v[i] = ((2*n - 4 + (n - 2)*x)*v[i - 1])/(n - 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

A081277 reversed triangle, offset 0, from P1
%e Example
Triangle begins:
  0: 1;
  1: 1,  1;
  2: 1,  3,   2;
  3: 1,  5,   8,   4;
  4: 1,  7,  18,  20,    8;
  5: 1,  9,  32,  56,   48,   16;
  6: 1, 11,  50, 120,  160,  112,   32;
  7: 1, 13,  72, 220,  400,  432,  256,   64;
  8: 1, 15,  98, 364,  840, 1232, 1120,  576,  128;
  9: 1, 17, 128, 560, 1568, 2912, 3584, 2816, 1280, 256;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (2*n-2+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 2 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 2 + (n - 1)*x)*v[i - 1])/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

A200139 triangle, offset 0, from P1
%e Example
Triangle begins:
  0:   1;
  1:   1,    1;
  2:   2,    3,    1;
  3:   4,    8,    5,    1;
  4:   8,   20,   18,    7,    1;
  5:  16,   48,   56,   32,    9,    1;
  6:  32,  112,  160,  120,   50,   11,   1;
  7:  64,  256,  432,  400,  220,   72,  13,   1;
  8: 128,  576, 1120, 1232,  840,  364,  98,  15,  1;
  9: 256, 1280, 2816, 3584, 2912, 1568, 560, 128, 17, 1;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 2 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 2 + (n - 1)*x)*v[i - 1])/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

Used in 5

Same fingerprint ?

References

  1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [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
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.