A161198 → basis A013611 → x ↦ x+1

nonnegative coefficientsonly rational roots

Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

\(P_{n}(x) = \left(7 + 8\,x + 2\,n\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
211819
314319264399
42145402424965129177
5364658556874624286724096229425
6692835191751221024001141760307200327686194475
714549535458104325949049640796160155852803145728262144179639775
83346393051170036216173476486414142356486848307201970339843119513620971525568833025
Technical details
Node id
n-ccc091ad88142f3d · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-f61108631909956f

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:            1;
   2:           11,            8;
   3:          143,          192,            64;
   4:         2145,         4024,          2496,           512;
   5:        36465,        85568,         74624,         28672,          4096;
   6:       692835,      1917512,       2102400,       1141760,        307200,        32768;
   7:     14549535,     45810432,      59490496,      40796160,      15585280,      3145728,       262144;
   8:    334639305,   1170036216,    1734764864,    1414235648,     684830720,    197033984,     31195136,     2097152;
   9:   8365982625,  31928019840,   52729411328,   49234010112,   28434653184,  10404495360,   2356150272,   301989888,   16777216;
  10: 225881530875, 928984396680, 1679118264576, 1751153563648, 1161607716864, 508398600192, 146852020224, 27002929152, 2868903936, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+7+8*x)*P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2*n + 7 + 8*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (2*n + 7 + 8*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

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.