A193727 → basis A007318

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1314
22113236
3147133404324
41029122554610882916
5720310633627218482721626244
650421888376517025480560065632236196
735294772270163386430870090160157921536642125764
Technical details
Node id
n-900542f3957c96da · revision 0 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-c9d8ccf40269e636

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,        1;
  2:       21,       13,        2;
  3:      147,      133,       40,        4;
  4:     1029,     1225,      546,      108,        8;
  5:     7203,    10633,     6272,     1848,      272,      16;
  6:    50421,    88837,    65170,    25480,     5600,     656,     32;
  7:   352947,   722701,   633864,   308700,    90160,   15792,   1536,     64;
  8:  2470629,  5764801,  5882450,  3428628,  1248520,  290864,  42336,   3520,  128;
  9: 17294403, 45294865, 52706752, 35765296, 15596896, 4533088, 878080, 109312, 7936, 256;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (7*n-7+(2*n-2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + x;
P[n_, x_] := P[n, x] = Expand[Together[((7*n - 7 + (2*n - 2)*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 + x; for(n = 2, N, my(i = n + 1); v[i] = ((7*n - 7 + (2*n - 2)*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.