A253283 → basis A013611

nonnegative coefficients

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

Recurrence

\(\left(1 - n\right)\,P_{n}(x) = \left(4 - n\right)\,P_{n-3}(x) + \left(-23 - 56\,x + 7\,n + 16\,n x\right)\,P_{n-2}(x) + \left(12 + 24\,x - 7\,n - 16\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 4\,x\)
\(P_{3}(x) = 5 + 32\,x + 48\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2145
35324885
4252286726401565
51291536672012800896030145
66811002058080165760232960129024596525
7365364032462000175616037094404128768189235212016405
81982540339634823041653120046609920780595207190937628114944245130485
Technical details
Node id
n-73196e5694372c86 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-a7df9941ce8978da

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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:      1;
   2:      1,        4;
   3:      5,       32,        48;
   4:     25,      228,       672,        640;
   5:    129,     1536,      6720,      12800,       8960;
   6:    681,    10020,     58080,     165760,     232960,      129024;
   7:   3653,    64032,    462000,    1756160,    3709440,     4128768,     1892352;
   8:  19825,   403396,   3482304,   16531200,   46609920,    78059520,    71909376,    28114944;
   9: 108545,  2514944,  25272576,  143861760,  507386880,  1135411200,  1574436864,  1237057536,   421724160;
  10: 598417, 15554628, 178332480, 1183607040, 5011776000, 14040778752, 26027409408, 30785863680, 21086208000, 6372720640;
%F Formula
The row polynomials satisfy -(n-1)*P(n,x) = -(n-4)*P(n-3,x) + (7*n-23+(16*n-56)*x)*P(n-2,x) - (7*n-12+(16*n-24)*x)*P(n-1,x) for n >= 4, with P(1,x) = 1, P(2,x) = 1 + 4*x, P(3,x) = 5 + 32*x + 48*x^2.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + 4*x;
P[3, x_] := 5 + 32*x + 48*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 4)*P[n - 3, x] + (7*n - 23 + (16*n - 56)*x)*P[n - 2, x] - (7*n - 12 + (16*n - 24)*x)*P[n - 1, x])/(-n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 4*x; v[3] = 5 + 32*x + 48*x^2; for(n = 4, N, my(i = n); v[i] = (-(n - 4)*v[i - 3] + (7*n - 23 + (16*n - 56)*x)*v[i - 2] - (7*n - 12 + (16*n - 24)*x)*v[i - 1])/(-n + 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. [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
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.