A124848: Triangle read by rows: T(n,k) = (k+1)*(k+2)*(k+3)*binomial(n,k)/6 (0 <= k <= n).

A124848 ↗ nonnegative coefficients

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

Recurrence from A124848

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1145
2181019
3112302063
4116608035192
512010020017556552
6124150400525336841520
7128210700122511765881204048
8132280112024503136235296016510496
913636016804410705670564320148522026624
10140450240073501411217640144007425220028666304
1114455033001155025872388083960027225121003146364162560
121486604400173254435277616950408167548400188764368455393216
131527805720250257207214414420592021235515730081796283925915560940032
141569107280350351121122522524118404954954404402862861324964140578406802224128
Technical details
Node id
n-7731fc957f5878fb · revision 0 · JSON
Definition source
oeis_catalog:A124848
Fingerprint
f6-f91847f627145760

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 ?

  • A124848 triangle 60 terms, 10 rows · tabl · nonn · catalog b-file?

Row sums ? A049612

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,  4;
  2: 1,  8,  10;
  3: 1, 12,  30,   20;
  4: 1, 16,  60,   80,   35;
  5: 1, 20, 100,  200,  175,   56;
  6: 1, 24, 150,  400,  525,  336,   84;
  7: 1, 28, 210,  700, 1225, 1176,  588,  120;
  8: 1, 32, 280, 1120, 2450, 3136, 2352,  960,  165;
  9: 1, 36, 360, 1680, 4410, 7056, 7056, 4320, 1485, 220;
%F Formula
The row polynomials satisfy n*P(n,x) = (2*n-1+(n+3)*x)*P(n-1,x) - (n-1+(n-1)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 1 + (n + 3)*x)*P[n - 1, x] - (n - 1 + (n - 1)*x)*P[n - 2, x])/(n)]];
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] = 1 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 1 + (n + 3)*x)*v[i - 1] - (n - 1 + (n - 1)*x)*v[i - 2])/(n)); 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

A124848 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  4;
  2: 1,  8,  10;
  3: 1, 12,  30,   20;
  4: 1, 16,  60,   80,   35;
  5: 1, 20, 100,  200,  175,   56;
  6: 1, 24, 150,  400,  525,  336,   84;
  7: 1, 28, 210,  700, 1225, 1176,  588,  120;
  8: 1, 32, 280, 1120, 2450, 3136, 2352,  960,  165;
  9: 1, 36, 360, 1680, 4410, 7056, 7056, 4320, 1485, 220;
%F Formula
The row polynomials satisfy n*P(n,x) = (2*n-1+(n+3)*x)*P(n-1,x) - (n-1+(n-1)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 1 + (n + 3)*x)*P[n - 1, x] - (n - 1 + (n - 1)*x)*P[n - 2, x])/(n)]];
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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 1 + (n + 3)*x)*v[i - 1] - (n - 1 + (n - 1)*x)*v[i - 2])/(n)); 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

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.