A193734 → basis A013609

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1347
215443291
3753405122561183
4375230052805376204815379
518751450044800691205324816384199927
69375875003400007040008192005079041310722599051
74687551250024000006240000972800090931204718592104857633787663
Technical details
Node id
n-0b6dd5684f4f06d7 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-267eeaa8c3e58d23

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,       44,        32;
  3:      75,      340,       512,       256;
  4:     375,     2300,      5280,      5376,      2048;
  5:    1875,    14500,     44800,     69120,     53248,      16384;
  6:    9375,    87500,    340000,    704000,    819200,     507904,     131072;
  7:   46875,   512500,   2400000,   6240000,   9728000,    9093120,    4718592,   1048576;
  8:  234375,  2937500,  16100000,  50400000,  98560000,  123289600,   96337920,  42991616,   8388608;
  9: 1171875, 16562500, 104000000, 380800000, 896000000, 1404928000, 1468006400, 985661440, 385875968, 67108864;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (5*n-5+(8*n-8)*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 + (8*n - 8)*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 + (8*n - 8)*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.