A304330: T(n, k) = Sum_{j=0..k} (-1)^j*binomial(2*k, j)*(k - j)^(2*n), triangle read by rows, n >= 0 and 0 <= k <= n.

A304330 ↗ nonnegative coefficients

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

Recurrence from A304330

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1011
2011213
30160360421
40125250402016025453
50110205292060480018144002473141
60140925068801264032099792000239500800352444093
7011638046846802306304003632428800217945728004358914560069251478661
80165532426535203952428480111567456000126408522240061024803840001046139494400017943523153933
90126214038584764065627452800314490496320060233972198400529085049292800213412456857600032011868528640005927841361456981
10011048572348049296010716467126408452909483200025835504542848003688775035545600026356438421913600091233825306624000012164510040883200002431910546406522973
11014194300313558938001734125500800022096755749376001041656568720768002277705950097177600257211806753341440001545501000694210560004683336365740032000005620003638888038400001212989379862721528101
120116777212282328873200279216010180800568026023241600004041640823286528000130565741105479680000219280499124470784000020389239392275353600000105562401683780321280000284372184127734743040000310224200866619719680000722875495525684291639213
130167108860254146317516044832665797920001445194499020272000152997013145104128000713329994400665241600017167529730497642496000023225267180951842406400001830415113744266649600000083178863857362412339200000201645730563302817792000000201645730563302817792000000507275965883448333971692021
140126843545222875181842240718745872144809603653335646768808000056986581470944245120003773771536487349196800001269921101408008777728000024065730514103270952960000027129752666204366610432000001852116035223936381419520000074951718050379657373286400000165147853331345007771648000000152444172305856930250752000000414031618935013558427928710653
Technical details
Node id
n-177268549ede7415 · revision 0 · JSON
Definition source
oeis_catalog:A304330
Fingerprint
f6-4ffec972130b4198

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 ?

  • A304330 triangle 45 terms, 9 rows · tabl · nonn · catalog b-file?

Row sums ? A100872

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1,     12;
  3: 0, 1,     60,       360;
  4: 0, 1,    252,      5040,       20160;
  5: 0, 1,   1020,     52920,      604800,       1814400;
  6: 0, 1,   4092,    506880,    12640320,      99792000,      239500800;
  7: 0, 1,  16380,   4684680,   230630400,    3632428800,    21794572800,     43589145600;
  8: 0, 1,  65532,  42653520,  3952428480,  111567456000,  1264085222400,   6102480384000,   10461394944000;
  9: 0, 1, 262140, 385847640, 65627452800, 3144904963200, 60233972198400, 529085049292800, 2134124568576000, 3201186852864000;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (2*n-2)*x*P(n-1,x) + ((n-1)*x+(10*n-10)*x^2)*d/dx P(n-1,x) + ((n-1)*x^2+(4*n-4)*x^3)*d^2/dx^2 P(n-1,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[((2*n - 2)*x*P[n - 1, x] + ((n - 1)*x + (10*n - 10)*x^2)*D[P[n - 1, x], x] + ((n - 1)*x^2 + (4*n - 4)*x^3)*D[P[n - 1, x], {x, 2}])/(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] = x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 2)*x*v[i - 1] + ((n - 1)*x + (10*n - 10)*x^2)*deriv(v[i - 1], x) + ((n - 1)*x^2 + (4*n - 4)*x^3)*deriv(deriv(v[i - 1], x), x))/(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

A304330 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1,     12;
  3: 0, 1,     60,       360;
  4: 0, 1,    252,      5040,       20160;
  5: 0, 1,   1020,     52920,      604800,       1814400;
  6: 0, 1,   4092,    506880,    12640320,      99792000,      239500800;
  7: 0, 1,  16380,   4684680,   230630400,    3632428800,    21794572800,     43589145600;
  8: 0, 1,  65532,  42653520,  3952428480,  111567456000,  1264085222400,   6102480384000,   10461394944000;
  9: 0, 1, 262140, 385847640, 65627452800, 3144904963200, 60233972198400, 529085049292800, 2134124568576000, 3201186852864000;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (2*n-2)*x*P(n-1,x) + ((n-1)*x+(10*n-10)*x^2)*d/dx P(n-1,x) + ((n-1)*x^2+(4*n-4)*x^3)*d^2/dx^2 P(n-1,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[((2*n - 2)*x*P[n - 1, x] + ((n - 1)*x + (10*n - 10)*x^2)*D[P[n - 1, x], x] + ((n - 1)*x^2 + (4*n - 4)*x^3)*D[P[n - 1, x], {x, 2}])/(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] = x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 2)*x*v[i - 1] + ((n - 1)*x + (10*n - 10)*x^2)*deriv(v[i - 1], x) + ((n - 1)*x^2 + (4*n - 4)*x^3)*deriv(deriv(v[i - 1], x), x))/(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 1

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