A290315 → reverse

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-6 - 3\,x + 4\,n + 2\,n x\right)\,P_{n-1}(x) + \left(4\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2213
31216129
4120284661471
5168059522872224110729
630240146064116336210807061314427
76652804130304480465615310721322282160111265701
8172972801325577602087916481014226401627108076050065301477107439
Technical details
Node id
n-4ebd12eca6adc5e0 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-4329a0349930abbf

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:           2,            1;
   3:          12,           16,            1;
   4:         120,          284,           66,            1;
   5:        1680,         5952,         2872,          224,            1;
   6:       30240,       146064,       116336,        21080,          706,           1;
   7:      665280,      4130304,      4804656,      1531072,       132228,        2160,          1;
   8:    17297280,    132557760,    208791648,    101422640,     16271080,      760500,       6530,        1;
   9:   518918400,   4766423040,   9657333504,   6556459008,   1661273440,   151922560,    4155120,    19648,     1;
  10: 17643225600, 189945688320, 477104352768, 427142449920, 155184721088, 23155279200, 1304454880, 21993776, 59010, 1;
%F Formula
The row polynomials satisfy P(n,x) = (4*n-6+(2*n-3)*x)*P(n-1,x) + (4*x-2*x^2)*d/dx 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[(4*n - 6 + (2*n - 3)*x)*P[n - 1, x] + (4*x - 2*x^2)*D[P[n - 1, x], 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] = (4*n - 6 + (2*n - 3)*x)*v[i - 1] + (4*x - 2*x^2)*deriv(v[i - 1], x)); 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. [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