A286718 → basis A013611 → basis A013609

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
16814
25412064238
3648187217285124760
497203326440896215044096109480
51749606765121002240714240245760327682846480
6367416015606432264591362301696010874880265420826214482547920
7881798404039476487598707207640801284451328001507000322752512020971522641533440
Technical details
Node id
n-433851efa70ad8d5 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-fca02a4f00624c07

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:           6,            8;
  2:          54,          120,           64;
  3:         648,         1872,         1728,          512;
  4:        9720,        33264,        40896,        21504,         4096;
  5:      174960,       676512,      1002240,       714240,       245760,        32768;
  6:     3674160,     15606432,     26459136,     23016960,     10874880,      2654208,       262144;
  7:    88179840,    403947648,    759870720,    764080128,    445132800,    150700032,     27525120,     2097152;
  8:  2380855680,  11612025216,  23748090624,  26709129216,  18131226624,   7629963264,   1948778496,   276824064,   16777216;
  9: 71425670400, 367407601920, 805338920448, 991258601472, 757609832448, 373948710912, 119503060992, 23894949888, 2717908992, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (3*n+3+8*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3*n + 3 + 8*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (3*n + 3 + 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 - 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.