A129186 → 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) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
011
111
2134
316916
419272764
51125410881256
6115902704052431024
7118135540121514587294096
8121189945283551035103218716384
912425215125670136082041217496656165536
101273242268102063061861236787325904919683262144
1113040532401701061236153090262440295245196830590491048576
12133495445526730112266336798721710108256510825656495391771474194304
131365945940400951924566735961732104324769543302603897234212576453144116777216
141397027722579153127411250964375289284440071407334516888014138174666908733159432367108864
Technical details
Node id
n-43cd8e4e0e20e5f1 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-f9762973ec1089d7

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (irregular)
  • 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: 1;
  2: 1,  3;
  3: 1,  6,   9;
  4: 1,  9,  27,   27;
  5: 1, 12,  54,  108,   81;
  6: 1, 15,  90,  270,  405,   243;
  7: 1, 18, 135,  540, 1215,  1458,   729;
  8: 1, 21, 189,  945, 2835,  5103,  5103,  2187;
  9: 1, 24, 252, 1512, 5670, 13608, 20412, 17496, 6561;
%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) = 1.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1;
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] = 1; 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.