A008288 → Veronese 2 → x ↦ x+1

nonnegative coefficients

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

Recurrence

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

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

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

\(P_{3}(x) = 2 + x\)

\(P_{4}(x) = 6 + 5\,x\)

Rows ?

n	x⁰	x¹	x²	x³	P_n(1)
1	1				1
2	1				1
3	2	1			3
4	6	5			11
5	15	15	1		31
6	35	43	9		87
7	84	126	44	1	255
8	204	358	168	13	743

All 15 rows

Technical details

Node id: n-64f89ad7ec668e81 · revision 0 · JSON
Definition source: derived:shift_x_plus_one
Fingerprint: f6-60a385d0c6f3ac1a

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 -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:    1;
   3:    2,    1;
   4:    6,    5;
   5:   15,   15,    1;
   6:   35,   43,    9;
   7:   84,  126,   44,   1;
   8:  204,  358,  168,  13;
   9:  493,  986,  582,  89,  1;
  10: 1189, 2674, 1914, 445, 17;

%F Formula

The row polynomials satisfy P(n,x) = (1+x)*P(n-4,x) + (2+2*x)*P(n-3,x) + x*P(n-2,x) + 2*P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 1, P(3,x) = 2 + x, P(4,x) = 6 + 5*x.

%t Mathematica

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

%o PARI/GP

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

Real-rooted? Every row P_n, n ≥ 1, 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 ≥ 1: the coefficients of P_n have one sign
derived from Affine, reversal and Möbius substitutions (elementary)
Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from veronese_section_2_0 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
  - Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
    
    from Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
    
    Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
    
    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 Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
    
    ↑ Liu–Wang theorem with a lag row (above)
    
    ↑ Liu–Wang theorem for three-term recurrences (above)
    
    Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
    
    from Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
    
    ↑ Liu–Wang theorem with a lag row (above)
    
    ↑ Liu–Wang theorem for three-term recurrences (above)
    
    Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
    
    from basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
    no recorded property covers this requirement
    
    Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
    
    from basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
    no recorded property covers this requirement
    
    ↑ Affine-current basis map theorem (above)
    
    ↑ Affine-current basis map theorem (above)
    
    ↑ Affine, reversal and Möbius substitutions (elementary) (above)
    
    ↑ Affine-current basis map theorem (above)
    
    ↑ Affine-current basis map theorem (above)

Related ?

Same fingerprint ?

delannoy → Veronese 2 → x ↦ x+1

References

[ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
[AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
[Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
[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