A096956: Pascal (1,6) triangle.

A096956 ↗ nonnegative coefficientsonly rational roots

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

Recurrence from A096956

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
066
1167
217614
31813628
4192119656
51103040256112
6111407065316224
71125111013596376448
811363161245231133436896
9114762244064763641764961792
10115903006308828405402255563584
111161053909301512172213807652806167168
1211712149513202442323431022145104534167614336
13118138616181537625676633652473190138640873628672
14119156754243155779438120121158384374576179448179657344
Technical details
Node id
n-b58d0e199d27164c · revision 1 · JSON
Definition source
oeis_catalog:A096956
Fingerprint
f6-3fe30cac0381d457

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

Matches ?

  • A096956 triangle 71 terms, 11 rows · tabl · nonn · catalog b-file?

Row sums ? A005009, A135092, A125176

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 6;
  1: 1,  6;
  2: 1,  7,  6;
  3: 1,  8, 13,   6;
  4: 1,  9, 21,  19,   6;
  5: 1, 10, 30,  40,  25,   6;
  6: 1, 11, 40,  70,  65,  31,   6;
  7: 1, 12, 51, 110, 135,  96,  37,   6;
  8: 1, 13, 63, 161, 245, 231, 133,  43,  6;
  9: 1, 14, 76, 224, 406, 476, 364, 176, 49, 6;
%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) = 6, P(1,x) = 1 + 6*x.
%t Mathematica
P[0, x_] := 6;
P[1, x_] := 1 + 6*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] = 6; v[2] = 1 + 6*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

A096956 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 6;
  1: 1,  6;
  2: 1,  7,  6;
  3: 1,  8, 13,   6;
  4: 1,  9, 21,  19,   6;
  5: 1, 10, 30,  40,  25,   6;
  6: 1, 11, 40,  70,  65,  31,   6;
  7: 1, 12, 51, 110, 135,  96,  37,   6;
  8: 1, 13, 63, 161, 245, 231, 133,  43,  6;
  9: 1, 14, 76, 224, 406, 476, 364, 176, 49, 6;
%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) = 6, P(1,x) = 1 + 6*x.
%t Mathematica
P[0, x_] := 6;
P[1, x_] := 1 + 6*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] = 6; v[2] = 1 + 6*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

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.