A038271 → basis A013611 → basis A013609

nonnegative coefficientsonly rational roots

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

Recurrence

\(P_{n}(x) = \left(32 + 40\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1324072
21024256016005184
33276812288015360064000373248
41048576524288098304008192000256000026873856
5335544322097152005242880006553600004096000001024000001934917632
610737418248053063680251658240004194304000039321600000196608000004096000000139314069504
734359738368300647710720112742891520023488102400002936012800000220200960000091750400000016384000000010030613004288
Technical details
Node id
n-17c78c88c7e7c0f0 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-6b726760bd05165a

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,              40;
  2:           1024,            2560,             1600;
  3:          32768,          122880,           153600,            64000;
  4:        1048576,         5242880,          9830400,          8192000,           2560000;
  5:       33554432,       209715200,        524288000,        655360000,         409600000,         102400000;
  6:     1073741824,      8053063680,      25165824000,      41943040000,       39321600000,       19660800000,        4096000000;
  7:    34359738368,    300647710720,    1127428915200,    2348810240000,     2936012800000,     2202009600000,      917504000000,     163840000000;
  8:  1099511627776,  10995116277760,   48103633715200,  120259084288000,   187904819200000,   187904819200000,   117440512000000,   41943040000000,    6553600000000;
  9: 35184372088832, 395824185999360, 1979120929996800, 5772436045824000, 10823317585920000, 13529146982400000, 11274289152000000, 6039797760000000, 1887436800000000, 262144000000000;
%F Formula
The row polynomials satisfy P(n,x) = (32+40*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 + 40*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 + 40*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.