A038271 → basis A013611 → 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(32 + 20\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1322052
2102412804002704
33276861440384008000140608
410485762621440245760010240001600007311616
53355443210485760013107200081920000256000003200000380204032
6107374182440265318406291456000524288000024576000006144000006400000019770609664
734359738368150323855360281857228800293601280000183500800000688128000001433600000012800000001028071702528
Technical details
Node id
n-92ad416bcd953046 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-4b28493176e02e0b

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:             32,              20;
  2:           1024,            1280,             400;
  3:          32768,           61440,           38400,            8000;
  4:        1048576,         2621440,         2457600,         1024000,          160000;
  5:       33554432,       104857600,       131072000,        81920000,        25600000,         3200000;
  6:     1073741824,      4026531840,      6291456000,      5242880000,      2457600000,       614400000,        64000000;
  7:    34359738368,    150323855360,    281857228800,    293601280000,    183500800000,     68812800000,     14336000000,     1280000000;
  8:  1099511627776,   5497558138880,  12025908428800,  15032385536000,  11744051200000,   5872025600000,   1835008000000,   327680000000,   25600000000;
  9: 35184372088832, 197912092999680, 494780232499200, 721554505728000, 676457349120000, 422785843200000, 176160768000000, 47185920000000, 7372800000000, 512000000000;
%F Formula
The row polynomials satisfy P(n,x) = (32+20*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[(32 + 20*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] = (32 + 20*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

Same fingerprint ?

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.