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

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-25 + 30\,x - 9\,x^{2} + 30\,n - 18\,n x - 9\,n^{2}\right)\,P_{n-2}(x) + \left(-7 + 6\,x + 6\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 3\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1437
21933961
314533318927694
4153441163213918819862
5207826187258410233554050243168712
634343211037241187271584955143370167677293380248
76699928228566282709711915453963472311078586266339218777685136
Technical details
Node id
n-7794429e5748ba6a · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-0a9a0c55c6b499ab

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:          4,           3;
  2:         19,          33,           9;
  3:        145,         333,         189,          27;
  4:       1534,        4116,        3213,         918,         81;
  5:      20782,       61872,       58410,       23355,       4050,        243;
  6:     343432,     1103724,     1187271,      584955,     143370,      16767,       729;
  7:    6699928,    22856628,    27097119,    15453963,    4723110,     785862,     66339,     2187;
  8:  150718096,   539725704,   690601392,   439744032,  157244409,   32897340,   3970134,   253692,   6561;
  9: 3840985360, 14324418216, 19504239804, 13549330404, 5459168988, 1346748039, 205630488, 18856314, 944784, 19683;
%F Formula
The row polynomials satisfy P(n,x) = -(9*n^2-30*n+25+(18*n-30)*x+9*x^2)*P(n-2,x) + (6*n-7+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(9*n^2 - 30*n + 25 + (18*n - 30)*x + 9*x^2)*P[n - 2, x] + (6*n - 7 + 6*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] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 30*n + 25 + (18*n - 30)*x + 9*x^2)*v[i - 2] + (6*n - 7 + 6*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.