A088996 → basis A007318 → basis A013609

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1224
21018836
38020417248504
48802884352419043849576
512320491767817661896244163840229824
6209440983832191910419903441157824358272460806664896
7418880022608800521557286667433651021296233749765937408645120226606464
Technical details
Node id
n-4f7f13d73e27c6c4 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-d796974d19a8998c

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 ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:          1;
  1:          2,           2;
  2:         10,          18,           8;
  3:         80,         204,         172,          48;
  4:        880,        2884,        3524,        1904,          384;
  5:      12320,       49176,       78176,       61896,        24416,        3840;
  6:     209440,      983832,     1919104,     1990344,      1157824,      358272,       46080;
  7:    4188800,    22608800,    52155728,    66674336,     51021296,    23374976,     5937408,      645120;
  8:   96342400,   587023200,  1561322544,  2368001376,   2240279184,  1353965184,   510560000,   109836288,   10321920;
  9: 2504902400, 16996766400, 51160803744, 89671841568, 100871283552, 75528120096, 37645933312, 12045823488, 2245423104, 185794560;
%F Formula
The row polynomials satisfy P(n,x) = (3*n-1+2*n*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3*n - 1 + 2*n*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (3*n - 1 + 2*n*x)*v[i - 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

Properties

Proof chains ? JSON

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.