A136521 → 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) = 2 + 6\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1268
22121832
32185454128
4224108216162512
52301805408104862048
623627010802430291614588192
7242378189056701020610206437432768
824850430241134027216408243499213122131072
92546484536204126123612247215746411809839366524288
102608106480340201224723061805248805904903936601180982097152
1126699089105346022453267359614434202165130216513012990783542948388608
1227211881188080190384912134719234642086495390866052077944684251528106288233554432
132781404154441158306254822501928750578416888014281466903377602827634932138174663188646134217728
14284163819656162162972972437837415011568394053667881073211821609812896301696722262446410449565938536870912
Technical details
Node id
n-e73305afb136be50 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-f9762973ec1089d7

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,  6;
  2: 2, 12,  18;
  3: 2, 18,  54,   54;
  4: 2, 24, 108,  216,   162;
  5: 2, 30, 180,  540,   810,   486;
  6: 2, 36, 270, 1080,  2430,  2916,   1458;
  7: 2, 42, 378, 1890,  5670, 10206,  10206,   4374;
  8: 2, 48, 504, 3024, 11340, 27216,  40824,  34992,  13122;
  9: 2, 54, 648, 4536, 20412, 61236, 122472, 157464, 118098, 39366;
%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) = 2 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 6*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] = 2 + 6*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.