A034807 → basis A007318

nonnegative coefficients

Proved for all n all roots real, in (−∞, −1]coefficients of one sign Hadamard kernel interlacing (weak)

Recurrence

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

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

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

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	P_n(1)
0	2								2
1	1								1
2	3	2							5
3	4	3							7
4	7	8	2						17
5	11	15	5						31
6	18	30	15	2					65
7	29	56	35	7					127
8	47	104	80	24	2				257
9	76	189	171	66	9				511
10	123	340	355	170	35	2			1025
11	199	605	715	407	110	11			2047
12	322	1068	1410	932	315	48	2		4097
13	521	1872	2730	2054	832	169	13		8191
14	843	3262	5208	4396	2079	532	63	2	16385

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

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

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

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

Technical details

Node id: n-1074deee959abad5 · revision 0 · JSON
Definition source: derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-cddea33175d38134)
Fingerprint: f6-c568ad932ec199be

Observed on the stored rows ?

Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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:  2;
  1:  1;
  2:  3,   2;
  3:  4,   3;
  4:  7,   8,   2;
  5: 11,  15,   5;
  6: 18,  30,  15,  2;
  7: 29,  56,  35,  7;
  8: 47, 104,  80, 24, 2;
  9: 76, 189, 171, 66, 9;

%F Formula

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

%t Mathematica

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

%o PARI/GP

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

Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, -1]
by Affine, reversal and Möbius substitutions (elementary)
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary), Affine, reversal and Möbius substitutions (elementary)
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary), Affine, reversal and Möbius substitutions (elementary)
Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
by Geometric basis map (elementary)
Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
by Geometric basis map (elementary)

Proof chains ? JSON

Geometric basis map (elementary) polytool ? step ›
- from Triangle T(n,k) of coefficients of Lucas (or Cardan) polynomials.?
  - Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
Ore-algebra identity of two definitions polytool ? step › direct check
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from Triangle T(n,k) of coefficients of Lucas (or Cardan) polynomials.?
  - ↑ Liu–Wang theorem for three-term recurrences (above)

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