A134059: Triangle T(n, k) = 3*binomial(n,k) with T(0, 0) = 1, read by rows.

A134059 ↗ palindromicγ-positivenonnegative coefficientsonly rational roots

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

Recurrence from A134059

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1336
236312
3399324
43121812348
5315303015396
6318456045183192
73216310510563213384
83248416821016884243768
93271082523783782521082731536
103301353606307566303601353033072
11333165495990138613869904951653336144
123361986601485237627722376148566019836312288
1333923485821453861514851483861214585823439324576
14342273109230036006900910296900960063003109227342349152
Technical details
Node id
n-7f71648c3ccd02d4 · revision 1 · JSON
Definition source
oeis_catalog:A134059
Fingerprint
f6-77a7ed3b1d5f257e

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

Matches ?

  • A134059 triangle 55 terms, 10 rows · tabl · nonn · catalog b-file?
  • A134059 reversed triangle 55 terms, 10 rows · tabl · nonn · catalog b-file?

Row sums ? A167881, A082505, A042950, A003945, A111286, A007283, A091629, A058764

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 3,  3;
  2: 3,  6,   3;
  3: 3,  9,   9,   3;
  4: 3, 12,  18,  12,   3;
  5: 3, 15,  30,  30,  15,   3;
  6: 3, 18,  45,  60,  45,  18,   3;
  7: 3, 21,  63, 105, 105,  63,  21,   3;
  8: 3, 24,  84, 168, 210, 168,  84,  24,  3;
  9: 3, 27, 108, 252, 378, 378, 252, 108, 27, 3;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 3*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];
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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1])/(n - 1)); 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

A134059 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 3,  3;
  2: 3,  6,   3;
  3: 3,  9,   9,   3;
  4: 3, 12,  18,  12,   3;
  5: 3, 15,  30,  30,  15,   3;
  6: 3, 18,  45,  60,  45,  18,   3;
  7: 3, 21,  63, 105, 105,  63,  21,   3;
  8: 3, 24,  84, 168, 210, 168,  84,  24,  3;
  9: 3, 27, 108, 252, 378, 378, 252, 108, 27, 3;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 3*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (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] = 3 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (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

A134059 reversed triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 3,  3;
  2: 3,  6,   3;
  3: 3,  9,   9,   3;
  4: 3, 12,  18,  12,   3;
  5: 3, 15,  30,  30,  15,   3;
  6: 3, 18,  45,  60,  45,  18,   3;
  7: 3, 21,  63, 105, 105,  63,  21,   3;
  8: 3, 24,  84, 168, 210, 168,  84,  24,  3;
  9: 3, 27, 108, 252, 378, 378, 252, 108, 27, 3;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 3*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (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] = 3 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (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

Properties

Proof chains ? JSON

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.