basis-map coefficients of A371080, shifted → D+1

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-36 + 12\,x - x^{2} + 36\,n - 6\,n x - 9\,n^{2}\right)\,P_{n-2}(x) + \left(-9 + 2\,x + 6\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1112
23519
3183612167
4162360153221698
51944464422954353519354
62916073548404199135990511153304
752488013821848232842109242772019537012971016
Technical details
Node id
n-9329f5c4405ead44 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-1d885b2b997ee023

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:         1;
  1:         1,         1;
  2:         3,         5,         1;
  3:        18,        36,        12,         1;
  4:       162,       360,       153,        22,        1;
  5:      1944,      4644,      2295,       435,       35,       1;
  6:     29160,     73548,     40419,      9135,      990,      51,      1;
  7:    524880,   1382184,    823284,    210924,    27720,    1953,     70,    1;
  8:  11022480,  30075624,  19099800,   5384232,   812889,   70308,   3486,   92,   1;
  9: 264539520, 743859936, 497997396, 151512444, 25441857, 2553201, 156870, 5778, 117, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(9*n^2-36*n+36+(6*n-12)*x+x^2)*P(n-2,x) + (6*n-9+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[-(9*n^2 - 36*n + 36 + (6*n - 12)*x + x^2)*P[n - 2, x] + (6*n - 9 + 2*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; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 36*n + 36 + (6*n - 12)*x + x^2)*v[i - 2] + (6*n - 9 + 2*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

References

  1. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.