A052553 → x ↦ x+1 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-10 - 2\,x + 10\,n - 3\,n x + n x^{2} + 5\,n^{2} x - 2\,n^{2} x^{2} + n^{3} x^{2}\right)\,P_{n}(x) = \left(-50 - 60\,x - 16\,x^{2} + 30\,n - 4\,n x - 27\,n x^{2} - 4\,n x^{3} + 20\,n^{2} x + 12\,n^{2} x^{2} - 2\,n^{2} x^{3} + 3\,n^{3} x^{2} + 2\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-25 - 55\,x - 38\,x^{2} - 8\,x^{3} - 25\,n x - 50\,n x^{2} - 29\,n x^{3} - 4\,n x^{4} - 5\,n^{2} x^{2} - 9\,n^{2} x^{3} - 4\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 1 | |||||||
| 3 | 2 | 2 | 4 | ||||||
| 4 | 3 | 4 | 7 | ||||||
| 5 | 5 | 10 | 3 | 18 | |||||
| 6 | 8 | 20 | 9 | 37 | |||||
| 7 | 13 | 40 | 27 | 4 | 84 | ||||
| 8 | 21 | 76 | 66 | 16 | 179 | ||||
| 9 | 34 | 142 | 153 | 56 | 5 | 390 | |||
| 10 | 55 | 260 | 333 | 160 | 25 | 833 | |||
| 11 | 89 | 470 | 699 | 420 | 100 | 6 | 1784 | ||
| 12 | 144 | 840 | 1422 | 1024 | 325 | 36 | 3791 | ||
| 13 | 233 | 1488 | 2826 | 2376 | 950 | 162 | 7 | 8042 | |
| 14 | 377 | 2616 | 5508 | 5296 | 2555 | 588 | 49 | 16989 | |
| 15 | 610 | 4570 | 10566 | 11440 | 6475 | 1890 | 245 | 8 | 35804 |
Compute more
?
Technical details
- Node id
n-602e5f94214b4713· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-88dd3d68aa6e666a
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 ExampleTriangle begins: 1: 1; 2: 1; 3: 2, 2; 4: 3, 4; 5: 5, 10, 3; 6: 8, 20, 9; 7: 13, 40, 27, 4; 8: 21, 76, 66, 16; 9: 34, 142, 153, 56, 5; 10: 55, 260, 333, 160, 25;
%F FormulaThe row polynomials satisfy (10*n-10+(5*n^2-3*n-2)*x+(n^3-2*n^2+n)*x^2)*P(n,x) = (30*n-50+(20*n^2-4*n-60)*x+(3*n^3+12*n^2-27*n-16)*x^2+(2*n^3-2*n^2-4*n)*x^3)*P(n-1,x) - (25+(25*n+55)*x+(5*n^2+50*n+38)*x^2+(9*n^2+29*n+8)*x^3+(4*n^2+4*n)*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((30*n - 50 + (20*n^2 - 4*n - 60)*x + (3*n^3 + 12*n^2 - 27*n - 16)*x^2 + (2*n^3 - 2*n^2 - 4*n)*x^3)*P[n - 1, x] - (25 + (25*n + 55)*x + (5*n^2 + 50*n + 38)*x^2 + (9*n^2 + 29*n + 8)*x^3 + (4*n^2 + 4*n)*x^4)*D[P[n - 1, x], x])/(10*n - 10 + (5*n^2 - 3*n - 2)*x + (n^3 - 2*n^2 + n)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((30*n - 50 + (20*n^2 - 4*n - 60)*x + (3*n^3 + 12*n^2 - 27*n - 16)*x^2 + (2*n^3 - 2*n^2 - 4*n)*x^3)*v[i - 1] - (25 + (25*n + 55)*x + (5*n^2 + 50*n + 38)*x^2 + (9*n^2 + 29*n + 8)*x^3 + (4*n^2 + 4*n)*x^4)*deriv(v[i - 1], x))/(10*n - 10 + (5*n^2 - 3*n - 2)*x + (n^3 - 2*n^2 + n)*x^2)); 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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
shift_x_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidi…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? 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
-
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
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
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
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ 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
delannoy?
- ↑ 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
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
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
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidi…?
Related ?
Same fingerprint ?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.