A034867 → D

nonnegative coefficients

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

Recurrence

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

\(P_{0}(x) = 0\)

\(P_{1}(x) = 0\)

\(P_{2}(x) = 1\)

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	P_n(1)
0								0
1								0
2	1							1
3	4							4
4	10	2						12
5	20	12						32
6	35	42	3					80
7	56	112	24					192
8	84	252	108	4				448
9	120	504	360	40				1024
10	165	924	990	220	5			2304
11	220	1584	2376	880	60			5120
12	286	2574	5148	2860	390	6		11264
13	364	4004	10296	8008	1820	84		24576
14	455	6006	19305	20020	6825	630	7	53248

Technical details

Node id: n-d8e29eddde2208df · revision 0 · JSON
Definition source: derived:derivative
Fingerprint: f6-583819957824c085

Observed on the stored rows ?

Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
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:   0;
  1:   0;
  2:   1;
  3:   4;
  4:  10,   2;
  5:  20,  12;
  6:  35,  42,   3;
  7:  56, 112,  24;
  8:  84, 252, 108,  4;
  9: 120, 504, 360, 40;

%F Formula

The row polynomials satisfy (n-2)*P(n,x) = (n+1+(n-3)*x)*P(n-1,x) + (2*x-2*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.

%t Mathematica

P[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n + 1 + (n - 3)*x)*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

%o PARI/GP

P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = ((n + 1 + (n - 3)*x)*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], x))/(n - 2)); 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

Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
by Laguerre’s theorem on differential operators
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators

Proof chains ? JSON

Laguerre’s theorem on differential operators [SP14] polytool ? step ›
- from Triangle of odd-numbered terms in rows of Pascal's triangle.?
  - Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
  - Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
    
    from Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.?
    
    Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check

Related ?

Same fingerprint ?

References

[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
[SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.