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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1347
215321663
37522020864567
43751400192011522565103
51875850015200134405888102445927
693755000011000012800083200286724096413343
7468752875007500001080000928000476160135168163843720087
Technical details
Node id
n-a8e35b1077239557 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-45e3acf8742875dd

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,       4;
  2:      15,      32,       16;
  3:      75,     220,      208,       64;
  4:     375,    1400,     1920,     1152,      256;
  5:    1875,    8500,    15200,    13440,     5888,     1024;
  6:    9375,   50000,   110000,   128000,    83200,    28672,     4096;
  7:   46875,  287500,   750000,  1080000,   928000,   476160,   135168,    16384;
  8:  234375, 1625000,  4900000,  8400000,  8960000,  6092800,  2580480,   622592,   65536;
  9: 1171875, 9062500, 31000000, 61600000, 78400000, 66304000, 37273600, 13434880, 2818048, 262144;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (5*n-5+(4*n-4)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 5 + (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] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = ((5*n - 5 + (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

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. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.