basis-map coefficients of A021012 → θ+1 → basis A013611

only rational roots

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

Recurrence

\(P_{n}(x) = \left(-n - 4\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2-2-8-10
364896150
4-24-288-1152-1536-3000
5120192011520307203072075000
6-720-14400-115200-460800-921600-737280-2250000
750401209601209600645120019353600309657602064384078750000
8-40320-1128960-13547520-90316800-361267200-867041280-1156055040-660602880-3150000000
Technical details
Node id
n-24b741eba413aeed · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-03d7b8417365c509

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): no
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:        1;
   2:       -2,         -8;
   3:        6,         48,          96;
   4:      -24,       -288,       -1152,        -1536;
   5:      120,       1920,       11520,        30720,         30720;
   6:     -720,     -14400,     -115200,      -460800,       -921600,       -737280;
   7:     5040,     120960,     1209600,      6451200,      19353600,      30965760,       20643840;
   8:   -40320,   -1128960,   -13547520,    -90316800,    -361267200,    -867041280,    -1156055040,     -660602880;
   9:   362880,   11612160,   162570240,   1300561920,    6502809600,   20808990720,    41617981440,    47563407360,    23781703680;
  10: -3628800, -130636800, -2090188800, -19508428800, -117050572800, -468202291200, -1248539443200, -2140353331200, -2140353331200, -951268147200;
%F Formula
The row polynomials satisfy P(n,x) = -(n+4*n*x)*P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(n + 4*n*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = -(n + 4*n*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, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

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.