A391533 → basis A013609 → D

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(1 + 2\,x + 3\,n + 2\,n x\right)\,P_{n}(x) = \left(8 + 16\,x + 8\,x^{2} + 6\,n + 10\,n x + 4\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 12 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8Pn(1)
012820
1426424130
212029624064720
3312107213687681603680
4768339259525184224038417920
518249856220802624017440614489684480
64224270087372811136010048054144161282048389120
79600709122284804193284793603494401585924096046081761280
Technical details
Node id
n-5548c32b67603fa1 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-eff54fadfb80e9ba

Observed on the stored rows ?

  • Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    12,      8;
  1:    42,     64,      24;
  2:   120,    296,     240,      64;
  3:   312,   1072,    1368,     768,     160;
  4:   768,   3392,    5952,    5184,    2240,     384;
  5:  1824,   9856,   22080,   26240,   17440,    6144,     896;
  6:  4224,  27008,   73728,  111360,  100480,   54144,   16128,    2048;
  7:  9600,  70912,  228480,  419328,  479360,  349440,  158592,   40960,    4608;
  8: 21504, 180224,  669696, 1447936, 2007040, 1849344, 1132544,  444416,  101376,  10240;
  9: 47616, 446464, 1880064, 4681728, 7633920, 8515584, 6580224, 3477504, 1202688, 245760, 22528;
%F Formula
The row polynomials satisfy (3*n+1+(2*n+2)*x)*P(n,x) = (6*n+8+(10*n+16)*x+(4*n+8)*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 12 + 8*x.
%t Mathematica
P[0, x_] := 12 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[((6*n + 8 + (10*n + 16)*x + (4*n + 8)*x^2)*P[n - 1, x])/(3*n + 1 + (2*n + 2)*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 12 + 8*x; for(n = 1, N, my(i = n + 1); v[i] = ((6*n + 8 + (10*n + 16)*x + (4*n + 8)*x^2)*v[i - 1])/(3*n + 1 + (2*n + 2)*x)); 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.