A156319 → basis A013610

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1336
2312924
3321452796
433010816281384
53391984865672431536
63483151080202519447296144
73574592025526580196561218724576
8366630340211340238143061821870656198304
9375828529221546578341020601137247217119683393216
103841053777637422122472275562419904413343236196590491572864
11393130510935607502347386429781246590167305514762257676371771476291456
1231021584148509355541698813471923175524541282564953905196312248005853144125165824
133111189019602138105697653259815672171001493939722733865246824821806899479716151594323100663296
14312022232527219691111119684691115150115683659069767552056928840779211644062178597255091684782969402653184
Technical details
Node id
n-5c4750b14b7bcd34 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-fb13869215ab1dd7

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: 3,  3;
  2: 3, 12,   9;
  3: 3, 21,  45,   27;
  4: 3, 30, 108,  162,    81;
  5: 3, 39, 198,  486,   567,   243;
  6: 3, 48, 315, 1080,  2025,  1944,    729;
  7: 3, 57, 459, 2025,  5265,  8019,   6561,   2187;
  8: 3, 66, 630, 3402, 11340, 23814,  30618,  21870,  6561;
  9: 3, 75, 828, 5292, 21546, 57834, 102060, 113724, 72171, 19683;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n-1+(3*n-3)*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 + (3*n - 3)*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 + (3*n - 3)*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

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