A330381 → θ+1

nonnegative coefficients

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

Recurrence

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

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

\(P_{1}(x) = 1 + 4\,x\)

\(P_{2}(x) = 1 + 10\,x + 9\,x^{2}\)

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	x⁸	x⁹	x¹⁰	x¹¹	x¹²	x¹³	x¹⁴	P_n(1)
0	1															1
1	1	4														5
2	1	10	9													20
3	1	18	39	16												74
4	1	28	105	104	25											263
5	1	40	225	384	225	36										911
6	1	54	420	1068	1080	426	49									3098
7	1	70	714	2492	3750	2562	735	64								10388
8	1	88	1134	5152	10615	10800	5390	1184	81							34445
9	1	108	1710	9744	26055	36276	27006	10368	1809	100						113177
10	1	130	2475	17208	57525	103818	105805	60720	18603	2650	121					369056
11	1	154	3465	28776	116985	263538	348047	273680	125631	31570	3751	144				1195742
12	1	180	4719	46024	222750	609180	1003555	1022832	644094	243100	51183	5160	169			3852947
13	1	208	6279	70928	401830	1305876	2609243	3316672	2708550	1404260	445159	79872	6929	196		12356003
14	1	238	8190	105924	692835	2630628	6239415	9615336	9794547	6590220	2873871	778284	120666	9114	225	39459494

Technical details

Node id: n-f0466f0ac25538d1 · revision 0 · JSON
Definition source: derived:theta_plus_one
Fingerprint: f6-257e06ca505cf193

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,   4;
  2: 1,  10,    9;
  3: 1,  18,   39,   16;
  4: 1,  28,  105,  104,    25;
  5: 1,  40,  225,  384,   225,    36;
  6: 1,  54,  420, 1068,  1080,   426,    49;
  7: 1,  70,  714, 2492,  3750,  2562,   735,    64;
  8: 1,  88, 1134, 5152, 10615, 10800,  5390,  1184,   81;
  9: 1, 108, 1710, 9744, 26055, 36276, 27006, 10368, 1809, 100;

%F Formula

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

%t Mathematica

P[0, x_] := 1;
P[1, x_] := 1 + 4*x;
P[2, x_] := 1 + 10*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((8 + 6*x - 6*x^2 + 4*x^3)*P[n - 3, x] + (1 - 3*x - 3*x^2 - 4*x^3)*D[P[n - 3, x], x] - (20 + 8*x + 12*x^2)*P[n - 2, x] - (2 - 6*x - 8*x^2)*D[P[n - 2, x], x] + (14 + 12*x)*P[n - 1, x] + (1 - 4*x)*D[P[n - 1, x], x])/(4)]];
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 + 4*x; v[3] = 1 + 10*x + 9*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((8 + 6*x - 6*x^2 + 4*x^3)*v[i - 3] + (1 - 3*x - 3*x^2 - 4*x^3)*deriv(v[i - 3], x) - (20 + 8*x + 12*x^2)*v[i - 2] - (2 - 6*x - 8*x^2)*deriv(v[i - 2], x) + (14 + 12*x)*v[i - 1] + (1 - 4*x)*deriv(v[i - 1], x))/(4)); 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 multiplier sequences
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences

Proof chains ? JSON

Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
- from Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 0 <= k <= …?
  - 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, of pairwise sums of trinomial coefficients (A027907).?
    
    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 ternary strings of length n with k indispensable digits, with 0 <= k <= …?
    
    ↑ Liu–Wang theorem for three-term recurrences (above)

References

[Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
[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.