A161198 → basis A013609 → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
27411
3636416143
4693956432642145
59009152009440256025636465
613513526403620240076160140801024692835
7229729550291524496944210432054400073728409614549535
8436486051047430681055585445796985618753280357683237273616384334639305
Technical details
Node id
n-9e117970c0630b95 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-fef1c3c767bad281

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,           4;
   3:          63,          64,          16;
   4:         693,         956,         432,          64;
   5:        9009,       15200,        9440,        2560,         256;
   6:      135135,      264036,      202400,       76160,       14080,       1024;
   7:     2297295,     5029152,     4496944,     2104320,      544000,      73728,       4096;
   8:    43648605,   104743068,   105558544,    57969856,    18753280,    3576832,     372736,     16384;
   9:   916620705,  2374198848,  2635701696,  1639601152,   625698304,  150126592,   22134784,   1835008,   65536;
  10: 21082276215, 58273056324, 70117934400, 48253633280, 20949465600, 5955704832, 1109606400, 130744320, 8847360, 262144;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+3+4*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 + 4*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 + 4*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.