A359363: Triangle read by rows. The coefficients of the Baxter polynomials p(0, x) = 1 and p(n, x) = x*hypergeom([-1 - n, -n, 1 - n], [2, 3], -x) for n >= 1.

A359363 ↗ palindromicγ-positivenonnegative coefficients

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

Recurrence from A359363

\(\left(6 + 5\,n + n^{2}\right)\,P_{n}(x) = \left(-1 - x + 2\,n + 5\,n x - n^{2} + 8\,n^{2} x\right)\,P_{n-1}(x) + \left(3\,x - 3\,x^{2} + 9\,n x - 9\,n x^{2}\right)\,P_{n-1}'(x) + \left(4 + 8\,x + 4\,x^{2} - 6\,n - 12\,n x - 6\,n x^{2} + 2\,n^{2} + 4\,n^{2} x + 2\,n^{2} x^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1011
20112
301416
4011010122
501205020192
60135175175351422
701564909804905612074
80184117641164116117684110754
90112025201411224696141122520120158202
10011654950415801164241164244158049501651326240
11012209075108900457380731808457380108900907522011882960
120128615730259545155727037374483737448155727025954515730286111140560
1301364260265725724723719161956082429341216195608472371957257226026364167329992
1401455414051184183130260136140834713158931513158931561408347130260131184183414054551414499438
Technical details
Node id
n-afb2f273dc5c03d1 · revision 0 · JSON
Definition source
oeis_catalog:A359363
Fingerprint
f6-509399d8a74ba170

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: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

Matches ?

  • A359363 triangle 66 terms, 11 rows · tabl · nonn · catalog b-file?
  • A056939 triangle 55 terms, 10 rows · tabl · nonn · catalog b-file?
  • A056939 reversed triangle 55 terms, 10 rows · tabl · nonn · catalog b-file?

Row sums ? A001181

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1,   1;
  3: 0, 1,   4,    1;
  4: 0, 1,  10,   10,     1;
  5: 0, 1,  20,   50,    20,     1;
  6: 0, 1,  35,  175,   175,    35,     1;
  7: 0, 1,  56,  490,   980,   490,    56,    1;
  8: 0, 1,  84, 1176,  4116,  4116,  1176,   84,   1;
  9: 0, 1, 120, 2520, 14112, 24696, 14112, 2520, 120, 1;
%F Formula
The row polynomials satisfy (n^2+5*n+6)*P(n,x) = -(n^2-2*n+1-(8*n^2+5*n-1)*x)*P(n-1,x) + ((9*n+3)*x-(9*n+3)*x^2)*d/dx P(n-1,x) + (2*n^2-6*n+4+(4*n^2-12*n+8)*x+(2*n^2-6*n+4)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 2*n + 1 - (8*n^2 + 5*n - 1)*x)*P[n - 1, x] + ((9*n + 3)*x - (9*n + 3)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 6*n + 4 + (4*n^2 - 12*n + 8)*x + (2*n^2 - 6*n + 4)*x^2)*P[n - 2, x])/(n^2 + 5*n + 6)]];
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; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 2*n + 1 - (8*n^2 + 5*n - 1)*x)*v[i - 1] + ((9*n + 3)*x - (9*n + 3)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 6*n + 4 + (4*n^2 - 12*n + 8)*x + (2*n^2 - 6*n + 4)*x^2)*v[i - 2])/(n^2 + 5*n + 6)); 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

A056939 triangle, offset 0, from P1, low zeros dropped
%e Example
Triangle begins:
  0: 1;
  1: 1,   1;
  2: 1,   4,    1;
  3: 1,  10,   10,     1;
  4: 1,  20,   50,    20,      1;
  5: 1,  35,  175,   175,     35,      1;
  6: 1,  56,  490,   980,    490,     56,     1;
  7: 1,  84, 1176,  4116,   4116,   1176,    84,    1;
  8: 1, 120, 2520, 14112,  24696,  14112,  2520,  120,   1;
  9: 1, 165, 4950, 41580, 116424, 116424, 41580, 4950, 165, 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^2+7*n+12)*P(n,x) = -(n^2-(8*n^2+21*n+12)*x)*P(n-1,x) + ((9*n+12)*x-(9*n+12)*x^2)*d/dx P(n-1,x) + (2*n^2-2*n+(4*n^2-4*n)*x+(2*n^2-2*n)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = x, P(1,x) = x + x^2.
%t Mathematica
P[0, x_] := x;
P[1, x_] := x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - (8*n^2 + 21*n + 12)*x)*P[n - 1, x] + ((9*n + 12)*x - (9*n + 12)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*P[n - 2, x])/(n^2 + 7*n + 12)]];
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] = x + x^2; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - (8*n^2 + 21*n + 12)*x)*v[i - 1] + ((9*n + 12)*x - (9*n + 12)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*v[i - 2])/(n^2 + 7*n + 12)); 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

A056939 reversed triangle, offset 0, from P1, low zeros dropped
%e Example
Triangle begins:
  0: 1;
  1: 1,   1;
  2: 1,   4,    1;
  3: 1,  10,   10,     1;
  4: 1,  20,   50,    20,      1;
  5: 1,  35,  175,   175,     35,      1;
  6: 1,  56,  490,   980,    490,     56,     1;
  7: 1,  84, 1176,  4116,   4116,   1176,    84,    1;
  8: 1, 120, 2520, 14112,  24696,  14112,  2520,  120,   1;
  9: 1, 165, 4950, 41580, 116424, 116424, 41580, 4950, 165, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, down to the lowest nonzero coefficient, where (n^2+7*n+12)*P(n,x) = -(n^2-(8*n^2+21*n+12)*x)*P(n-1,x) + ((9*n+12)*x-(9*n+12)*x^2)*d/dx P(n-1,x) + (2*n^2-2*n+(4*n^2-4*n)*x+(2*n^2-2*n)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = x, P(1,x) = x + x^2.
%t Mathematica
P[0, x_] := x;
P[1, x_] := x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - (8*n^2 + 21*n + 12)*x)*P[n - 1, x] + ((9*n + 12)*x - (9*n + 12)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*P[n - 2, x])/(n^2 + 7*n + 12)]];
Table[Reverse[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] = x + x^2; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - (8*n^2 + 21*n + 12)*x)*v[i - 1] + ((9*n + 12)*x - (9*n + 12)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*v[i - 2])/(n^2 + 7*n + 12)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); 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

A359363 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1,   1;
  3: 0, 1,   4,    1;
  4: 0, 1,  10,   10,     1;
  5: 0, 1,  20,   50,    20,     1;
  6: 0, 1,  35,  175,   175,    35,     1;
  7: 0, 1,  56,  490,   980,   490,    56,    1;
  8: 0, 1,  84, 1176,  4116,  4116,  1176,   84,   1;
  9: 0, 1, 120, 2520, 14112, 24696, 14112, 2520, 120, 1;
%F Formula
The row polynomials satisfy (n^2+5*n+6)*P(n,x) = -(n^2-2*n+1-(8*n^2+5*n-1)*x)*P(n-1,x) + ((9*n+3)*x-(9*n+3)*x^2)*d/dx P(n-1,x) + (2*n^2-6*n+4+(4*n^2-12*n+8)*x+(2*n^2-6*n+4)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 2*n + 1 - (8*n^2 + 5*n - 1)*x)*P[n - 1, x] + ((9*n + 3)*x - (9*n + 3)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 6*n + 4 + (4*n^2 - 12*n + 8)*x + (2*n^2 - 6*n + 4)*x^2)*P[n - 2, x])/(n^2 + 5*n + 6)]];
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; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 2*n + 1 - (8*n^2 + 5*n - 1)*x)*v[i - 1] + ((9*n + 3)*x - (9*n + 3)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 6*n + 4 + (4*n^2 - 12*n + 8)*x + (2*n^2 - 6*n + 4)*x^2)*v[i - 2])/(n^2 + 5*n + 6)); 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 6

Same fingerprint ?

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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.