A169803 → x ↦ x+1 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(100 + 210\,x + 124\,x^{2} + 18\,x^{3} + 4\,x^{4} + 100\,n + 335\,n x + 314\,n x^{2} + 105\,n x^{3} + 16\,n x^{4} + 125\,n^{2} x + 265\,n^{2} x^{2} + 157\,n^{2} x^{3} + 25\,n^{2} x^{4} + 75\,n^{3} x^{2} + 85\,n^{3} x^{3} + 19\,n^{3} x^{4} + 15\,n^{4} x^{3} + 7\,n^{4} x^{4} + n^{5} x^{4}\right)\,P_{n}(x) = \left(100 + 210\,x + 124\,x^{2} + 18\,x^{3} + 4\,x^{4} + 300\,n + 1380\,n x + 2152\,n x^{2} + 1483\,n x^{3} + 480\,n x^{4} + 72\,n x^{5} + 550\,n^{2} x + 1660\,n^{2} x^{2} + 1721\,n^{2} x^{3} + 737\,n^{2} x^{4} + 120\,n^{2} x^{5} + 300\,n^{3} x^{2} + 595\,n^{3} x^{3} + 371\,n^{3} x^{4} + 74\,n^{3} x^{5} + 55\,n^{4} x^{3} + 69\,n^{4} x^{4} + 20\,n^{4} x^{5} + 3\,n^{5} x^{4} + 2\,n^{5} x^{5}\right)\,P_{n-1}(x) + \left(-125 - 900\,x - 2435\,x^{2} - 3306\,x^{3} - 2426\,x^{4} - 924\,x^{5} - 144\,x^{6} - 375\,n x - 1850\,n x^{2} - 3500\,n x^{3} - 3193\,n x^{4} - 1408\,n x^{5} - 240\,n x^{6} - 300\,n^{2} x^{2} - 1040\,n^{2} x^{3} - 1325\,n^{2} x^{4} - 733\,n^{2} x^{5} - 148\,n^{2} x^{6} - 75\,n^{3} x^{3} - 185\,n^{3} x^{4} - 150\,n^{3} x^{5} - 40\,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_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 4 | 6 | ||||||
| 2 | 3 | 8 | 11 | ||||||
| 3 | 5 | 20 | 9 | 34 | |||||
| 4 | 8 | 40 | 27 | 75 | |||||
| 5 | 13 | 80 | 81 | 16 | 190 | ||||
| 6 | 21 | 152 | 198 | 64 | 435 | ||||
| 7 | 34 | 284 | 459 | 224 | 25 | 1026 | |||
| 8 | 55 | 520 | 999 | 640 | 125 | 2339 | |||
| 9 | 89 | 940 | 2097 | 1680 | 500 | 36 | 5342 | ||
| 10 | 144 | 1680 | 4266 | 4096 | 1625 | 216 | 12027 | ||
| 11 | 233 | 2976 | 8478 | 9504 | 4750 | 972 | 49 | 26962 | |
| 12 | 377 | 5232 | 16524 | 21184 | 12775 | 3528 | 343 | 59963 | |
| 13 | 610 | 9140 | 31698 | 45760 | 32375 | 11340 | 1715 | 64 | 132702 |
| 14 | 987 | 15880 | 59994 | 96320 | 78250 | 33264 | 6860 | 512 | 292067 |
Compute more
?
Technical details
- Node id
n-6980ec73d35c07b7· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-9a99cf3d0e7eaf56
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 4; 2: 3, 8; 3: 5, 20, 9; 4: 8, 40, 27; 5: 13, 80, 81, 16; 6: 21, 152, 198, 64; 7: 34, 284, 459, 224, 25; 8: 55, 520, 999, 640, 125; 9: 89, 940, 2097, 1680, 500, 36;
%F FormulaThe row polynomials satisfy (100*n+100+(125*n^2+335*n+210)*x+(75*n^3+265*n^2+314*n+124)*x^2+(15*n^4+85*n^3+157*n^2+105*n+18)*x^3+(n^5+7*n^4+19*n^3+25*n^2+16*n+4)*x^4)*P(n,x) = (300*n+100+(550*n^2+1380*n+210)*x+(300*n^3+1660*n^2+2152*n+124)*x^2+(55*n^4+595*n^3+1721*n^2+1483*n+18)*x^3+(3*n^5+69*n^4+371*n^3+737*n^2+480*n+4)*x^4+(2*n^5+20*n^4+74*n^3+120*n^2+72*n)*x^5)*P(n-1,x) - (125+(375*n+900)*x+(300*n^2+1850*n+2435)*x^2+(75*n^3+1040*n^2+3500*n+3306)*x^3+(5*n^4+185*n^3+1325*n^2+3193*n+2426)*x^4+(9*n^4+150*n^3+733*n^2+1408*n+924)*x^5+(4*n^4+40*n^3+148*n^2+240*n+144)*x^6)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((300*n + 100 + (550*n^2 + 1380*n + 210)*x + (300*n^3 + 1660*n^2 + 2152*n + 124)*x^2 + (55*n^4 + 595*n^3 + 1721*n^2 + 1483*n + 18)*x^3 + (3*n^5 + 69*n^4 + 371*n^3 + 737*n^2 + 480*n + 4)*x^4 + (2*n^5 + 20*n^4 + 74*n^3 + 120*n^2 + 72*n)*x^5)*P[n - 1, x] - (125 + (375*n + 900)*x + (300*n^2 + 1850*n + 2435)*x^2 + (75*n^3 + 1040*n^2 + 3500*n + 3306)*x^3 + (5*n^4 + 185*n^3 + 1325*n^2 + 3193*n + 2426)*x^4 + (9*n^4 + 150*n^3 + 733*n^2 + 1408*n + 924)*x^5 + (4*n^4 + 40*n^3 + 148*n^2 + 240*n + 144)*x^6)*D[P[n - 1, x], x])/(100*n + 100 + (125*n^2 + 335*n + 210)*x + (75*n^3 + 265*n^2 + 314*n + 124)*x^2 + (15*n^4 + 85*n^3 + 157*n^2 + 105*n + 18)*x^3 + (n^5 + 7*n^4 + 19*n^3 + 25*n^2 + 16*n + 4)*x^4)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((300*n + 100 + (550*n^2 + 1380*n + 210)*x + (300*n^3 + 1660*n^2 + 2152*n + 124)*x^2 + (55*n^4 + 595*n^3 + 1721*n^2 + 1483*n + 18)*x^3 + (3*n^5 + 69*n^4 + 371*n^3 + 737*n^2 + 480*n + 4)*x^4 + (2*n^5 + 20*n^4 + 74*n^3 + 120*n^2 + 72*n)*x^5)*v[i - 1] - (125 + (375*n + 900)*x + (300*n^2 + 1850*n + 2435)*x^2 + (75*n^3 + 1040*n^2 + 3500*n + 3306)*x^3 + (5*n^4 + 185*n^3 + 1325*n^2 + 3193*n + 2426)*x^4 + (9*n^4 + 150*n^3 + 733*n^2 + 1408*n + 924)*x^5 + (4*n^4 + 40*n^3 + 148*n^2 + 240*n + 144)*x^6)*deriv(v[i - 1], x))/(100*n + 100 + (125*n^2 + 335*n + 210)*x + (75*n^3 + 265*n^2 + 314*n + 124)*x^2 + (15*n^4 + 85*n^3 + 157*n^2 + 105*n + 18)*x^3 + (n^5 + 7*n^4 + 19*n^3 + 25*n^2 + 16*n + 4)*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]
-
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
shift_x_plus_one of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
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…?
-
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.?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
-
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 Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).?
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.