A129186 → basis A013611

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 - 4\,x + n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
011
111
2145
3181625
41124864125
511696256256625
6120160640128010243125
7124240128038406144409615625
81283362240896021504286721638478125
91324483584179205734411468813107265536390625
101365765376322561290243440645898245898242621441953125
1114072076805376025804886016019660802949120262144010485769765625
12144880105608448047308818923525406720108134401441792011534336419430448828125
131481056140801267208110083784704129761283244032057671680692060165033164816777216244140625
14152124818304183040131788870287362811494484344832187432960299892736327155712218103808671088641220703125
Technical details
Node id
n-9de0875f066ebfc9 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-03d7b8417365c509

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,  4;
  3: 1,  8,  16;
  4: 1, 12,  48,   64;
  5: 1, 16,  96,  256,   256;
  6: 1, 20, 160,  640,  1280,  1024;
  7: 1, 24, 240, 1280,  3840,  6144,   4096;
  8: 1, 28, 336, 2240,  8960, 21504,  28672,  16384;
  9: 1, 32, 448, 3584, 17920, 57344, 114688, 131072, 65536;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n-1+(4*n-4)*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 + (4*n - 4)*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 + (4*n - 4)*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.