A155112: Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,-1/2,0,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.

A155112 ↗ nonnegative coefficients

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

Recurrence from A155112

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1011
20213
303418
405106122
50822218160
6013455936101164
70218814712455121448
8034167339366225781411224
90553107419767703701051613344
1008956615572422233714435671361819136
11014410203174569665054920248582417120124960
1202331819631712849169601520594154012114921022168192
130377321612330280364201043590320251673661561550253241186304
1406105645236825953299855117765100235621882805390652035300261508992
Technical details
Node id
n-ff76d530e3f3a037 · revision 0 · JSON
Definition source
oeis_catalog:A155112
Fingerprint
f6-1d84b6f5e9f3dbf6

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 ?

  • A154929 triangle 62 terms, 10 rows · tabl · nonn · catalog b-file?
  • A155112 triangle 78 terms, 12 rows · tabl · nonn · catalog b-file?

Row sums ? A028859, A155020

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 0,  1;
  2: 0,  2,   1;
  3: 0,  3,   4,   1;
  4: 0,  5,  10,   6,   1;
  5: 0,  8,  22,  21,   8,   1;
  6: 0, 13,  45,  59,  36,  10,   1;
  7: 0, 21,  88, 147, 124,  55,  12,   1;
  8: 0, 34, 167, 339, 366, 225,  78,  14,  1;
  9: 0, 55, 310, 741, 976, 770, 370, 105, 16, 1;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) + (n-2+(n-2)*x)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = x, P(2,x) = 2*x + x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := x;
P[2, x_] := 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x] + (n - 2 + (n - 2)*x)*P[n - 2, x])/(n - 2)]];
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] = x; v[3] = 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1] + (n - 2 + (n - 2)*x)*v[i - 2])/(n - 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

A154929 triangle, offset 0, from P1, low zeros dropped
%e Example
Triangle begins:
  0:  1;
  1:  2,   1;
  2:  3,   4,    1;
  3:  5,  10,    6,    1;
  4:  8,  22,   21,    8,    1;
  5: 13,  45,   59,   36,   10,    1;
  6: 21,  88,  147,  124,   55,   12,   1;
  7: 34, 167,  339,  366,  225,   78,  14,   1;
  8: 55, 310,  741,  976,  770,  370, 105,  16,  1;
  9: 89, 566, 1557, 2422, 2337, 1443, 567, 136, 18, 1;
%F Formula
Row n lists the coefficients of P(n,x) in ascending powers of x, starting at the lowest nonzero coefficient, where (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) + (n-1+(n-1)*x)*P(n-2,x) for n >= 2, with P(0,x) = x, P(1,x) = 2*x + x^2.
%t Mathematica
P[0, x_] := x;
P[1, x_] := 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x] + (n - 1 + (n - 1)*x)*P[n - 2, x])/(n - 1)]];
Table[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = x; v[2] = 2*x + x^2; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1] + (n - 1 + (n - 1)*x)*v[i - 2])/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); 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

A155112 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 0,  1;
  2: 0,  2,   1;
  3: 0,  3,   4,   1;
  4: 0,  5,  10,   6,   1;
  5: 0,  8,  22,  21,   8,   1;
  6: 0, 13,  45,  59,  36,  10,   1;
  7: 0, 21,  88, 147, 124,  55,  12,   1;
  8: 0, 34, 167, 339, 366, 225,  78,  14,  1;
  9: 0, 55, 310, 741, 976, 770, 370, 105, 16, 1;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) + (n-2+(n-2)*x)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = x, P(2,x) = 2*x + x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := x;
P[2, x_] := 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x] + (n - 2 + (n - 2)*x)*P[n - 2, x])/(n - 2)]];
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] = x; v[3] = 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1] + (n - 2 + (n - 2)*x)*v[i - 2])/(n - 2)); 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

  • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check

Used in 5

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