A052553 → x ↦ x+1 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-100 + 40\,x - 44\,x^{2} - 4\,x^{3} + 100\,n - 165\,n x + 154\,n x^{2} + 17\,n x^{3} + 125\,n^{2} x - 185\,n^{2} x^{2} + 7\,n^{2} x^{3} - n^{2} x^{4} + 75\,n^{3} x^{2} - 35\,n^{3} x^{3} + 3\,n^{3} x^{4} + 15\,n^{4} x^{3} - 3\,n^{4} x^{4} + n^{5} x^{4}\right)\,P_{n}(x) = \left(-500 - 350\,x + 60\,x^{2} + 56\,x^{3} + 32\,x^{4} + 300\,n - 820\,n x - 888\,n x^{2} - 21\,n x^{3} + 16\,n x^{4} + 550\,n^{2} x - 140\,n^{2} x^{2} - 529\,n^{2} x^{3} - 73\,n^{2} x^{4} - 4\,n^{2} x^{5} + 300\,n^{3} x^{2} + 155\,n^{3} x^{3} - 61\,n^{3} x^{4} - 6\,n^{3} x^{5} + 55\,n^{4} x^{3} + 39\,n^{4} x^{4} + 3\,n^{5} x^{4} + 2\,n^{5} x^{5}\right)\,P_{n-1}(x) + \left(-125 - 150\,x + 65\,x^{2} + 134\,x^{3} + 60\,x^{4} + 16\,x^{5} - 375\,n x - 650\,n x^{2} - 240\,n x^{3} + 47\,n x^{4} + 12\,n x^{5} - 300\,n^{2} x^{2} - 590\,n^{2} x^{3} - 335\,n^{2} x^{4} - 49\,n^{2} x^{5} - 4\,n^{2} x^{6} - 75\,n^{3} x^{3} - 145\,n^{3} x^{4} - 78\,n^{3} x^{5} - 8\,n^{3} x^{6} - 5\,n^{4} x^{4} - 9\,n^{4} x^{5} - 4\,n^{4} x^{6}\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 | 4 | 6 | ||||||
| 4 | 3 | 8 | 11 | ||||||
| 5 | 5 | 20 | 9 | 34 | |||||
| 6 | 8 | 40 | 27 | 75 | |||||
| 7 | 13 | 80 | 81 | 16 | 190 | ||||
| 8 | 21 | 152 | 198 | 64 | 435 | ||||
| 9 | 34 | 284 | 459 | 224 | 25 | 1026 | |||
| 10 | 55 | 520 | 999 | 640 | 125 | 2339 | |||
| 11 | 89 | 940 | 2097 | 1680 | 500 | 36 | 5342 | ||
| 12 | 144 | 1680 | 4266 | 4096 | 1625 | 216 | 12027 | ||
| 13 | 233 | 2976 | 8478 | 9504 | 4750 | 972 | 49 | 26962 | |
| 14 | 377 | 5232 | 16524 | 21184 | 12775 | 3528 | 343 | 59963 | |
| 15 | 610 | 9140 | 31698 | 45760 | 32375 | 11340 | 1715 | 64 | 132702 |
Compute more
?
Technical details
- Node id
n-062c4929abd8e172· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-9a99cf3d0e7eaf56
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, 4; 4: 3, 8; 5: 5, 20, 9; 6: 8, 40, 27; 7: 13, 80, 81, 16; 8: 21, 152, 198, 64; 9: 34, 284, 459, 224, 25; 10: 55, 520, 999, 640, 125;
%F FormulaThe row polynomials satisfy (100*n-100+(125*n^2-165*n+40)*x+(75*n^3-185*n^2+154*n-44)*x^2+(15*n^4-35*n^3+7*n^2+17*n-4)*x^3+(n^5-3*n^4+3*n^3-n^2)*x^4)*P(n,x) = (300*n-500+(550*n^2-820*n-350)*x+(300*n^3-140*n^2-888*n+60)*x^2+(55*n^4+155*n^3-529*n^2-21*n+56)*x^3+(3*n^5+39*n^4-61*n^3-73*n^2+16*n+32)*x^4+(2*n^5-6*n^3-4*n^2)*x^5)*P(n-1,x) - (125+(375*n+150)*x+(300*n^2+650*n-65)*x^2+(75*n^3+590*n^2+240*n-134)*x^3+(5*n^4+145*n^3+335*n^2-47*n-60)*x^4+(9*n^4+78*n^3+49*n^2-12*n-16)*x^5+(4*n^4+8*n^3+4*n^2)*x^6)*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[((300*n - 500 + (550*n^2 - 820*n - 350)*x + (300*n^3 - 140*n^2 - 888*n + 60)*x^2 + (55*n^4 + 155*n^3 - 529*n^2 - 21*n + 56)*x^3 + (3*n^5 + 39*n^4 - 61*n^3 - 73*n^2 + 16*n + 32)*x^4 + (2*n^5 - 6*n^3 - 4*n^2)*x^5)*P[n - 1, x] - (125 + (375*n + 150)*x + (300*n^2 + 650*n - 65)*x^2 + (75*n^3 + 590*n^2 + 240*n - 134)*x^3 + (5*n^4 + 145*n^3 + 335*n^2 - 47*n - 60)*x^4 + (9*n^4 + 78*n^3 + 49*n^2 - 12*n - 16)*x^5 + (4*n^4 + 8*n^3 + 4*n^2)*x^6)*D[P[n - 1, x], x])/(100*n - 100 + (125*n^2 - 165*n + 40)*x + (75*n^3 - 185*n^2 + 154*n - 44)*x^2 + (15*n^4 - 35*n^3 + 7*n^2 + 17*n - 4)*x^3 + (n^5 - 3*n^4 + 3*n^3 - n^2)*x^4)]];
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] = ((300*n - 500 + (550*n^2 - 820*n - 350)*x + (300*n^3 - 140*n^2 - 888*n + 60)*x^2 + (55*n^4 + 155*n^3 - 529*n^2 - 21*n + 56)*x^3 + (3*n^5 + 39*n^4 - 61*n^3 - 73*n^2 + 16*n + 32)*x^4 + (2*n^5 - 6*n^3 - 4*n^2)*x^5)*v[i - 1] - (125 + (375*n + 150)*x + (300*n^2 + 650*n - 65)*x^2 + (75*n^3 + 590*n^2 + 240*n - 134)*x^3 + (5*n^4 + 145*n^3 + 335*n^2 - 47*n - 60)*x^4 + (9*n^4 + 78*n^3 + 49*n^2 - 12*n - 16)*x^5 + (4*n^4 + 8*n^3 + 4*n^2)*x^6)*deriv(v[i - 1], x))/(100*n - 100 + (125*n^2 - 165*n + 40)*x + (75*n^3 - 185*n^2 + 154*n - 44)*x^2 + (15*n^4 - 35*n^3 + 7*n^2 + 17*n - 4)*x^3 + (n^5 - 3*n^4 + 3*n^3 - n^2)*x^4)); 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.