A161198 → basis A013609 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
271623
363256256575
469338246912409615525
590096080015104016384065536450225
61351351056144323840048742403604480104857613956975
7229729520116608719511041346764801392640007549747216777216460580175
8436486054189722721688936704371007078448008396803662675968152672665626843545616120306125
Technical details
Node id
n-50ffd4b73d3b3e5a · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-3e43dba81045e2fd

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:           7,           16;
   3:          63,          256,           256;
   4:         693,         3824,          6912,          4096;
   5:        9009,        60800,        151040,        163840,         65536;
   6:      135135,      1056144,       3238400,       4874240,       3604480,       1048576;
   7:     2297295,     20116608,      71951104,     134676480,     139264000,      75497472,      16777216;
   8:    43648605,    418972272,    1688936704,    3710070784,    4800839680,    3662675968,    1526726656,     268435456;
   9:   916620705,   9496795392,   42171227136,  104934473728,  160178765824,  153729630208,   90664075264,   30064771072,   4294967296;
  10: 21082276215, 233092225296, 1121886950400, 3088232529920, 5363063193600, 6098641747968, 4544947814400, 2142114938880, 579820584960, 68719476736;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+3+16*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 + 3 + 16*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 + 3 + 16*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.