A026729 → basis A013610 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(25 - 255\,x + 306\,x^{2} + 702\,x^{3} + 81\,x^{4} - 243\,x^{5} + 225\,n x - 990\,n x^{2} - 486\,n x^{3} + 1134\,n x^{4} + 243\,n x^{5} + 540\,n^{2} x^{2} - 675\,n^{2} x^{3} - 1053\,n^{2} x^{4} + 243\,n^{2} x^{5} + 405\,n^{3} x^{3} - 243\,n^{3} x^{5} + 81\,n^{4} x^{4}\right)\,P_{n}(x) = \left(25 + 45\,x - 234\,x^{2} - 486\,x^{3} + 81\,x^{4} + 729\,x^{5} + 225\,n x + 765\,n x^{2} - 351\,n x^{3} - 2511\,n x^{4} - 1944\,n x^{5} + 540\,n^{2} x^{2} + 2160\,n^{2} x^{3} + 1053\,n^{2} x^{4} - 2187\,n^{2} x^{5} - 1458\,n^{2} x^{6} + 405\,n^{3} x^{3} + 1539\,n^{3} x^{4} + 729\,n^{3} x^{5} - 729\,n^{3} x^{6} + 81\,n^{4} x^{4} + 243\,n^{4} x^{5}\right)\,P_{n-2}(x) + \left(25 + 45\,x - 234\,x^{2} - 486\,x^{3} + 81\,x^{4} + 729\,x^{5} + 225\,n x + 450\,n x^{2} - 1836\,n x^{3} - 3888\,n x^{4} - 1215\,n x^{5} + 540\,n^{2} x^{2} + 1755\,n^{2} x^{3} - 486\,n^{2} x^{4} - 2916\,n^{2} x^{5} - 729\,n^{2} x^{6} + 405\,n^{3} x^{3} + 1377\,n^{3} x^{4} + 243\,n^{3} x^{5} - 729\,n^{3} x^{6} + 81\,n^{4} x^{4} + 243\,n^{4} x^{5}\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 1 | 12 | 13 | |||||||||||||
| 3 | 2 | 36 | 81 | 119 | ||||||||||||
| 4 | 3 | 84 | 405 | 432 | 924 | |||||||||||
| 5 | 5 | 180 | 1296 | 3024 | 2025 | 6530 | ||||||||||
| 6 | 8 | 360 | 3483 | 12528 | 18225 | 8748 | 43352 | |||||||||
| 7 | 13 | 696 | 8424 | 41040 | 93150 | 96228 | 35721 | 275272 | ||||||||
| 8 | 21 | 1308 | 19035 | 117072 | 362475 | 586116 | 464373 | 139968 | 1690368 | |||||||
| 9 | 34 | 2412 | 40986 | 304560 | 1196775 | 2650644 | 3286332 | 2099520 | 531441 | 10112704 | ||||||
| 10 | 55 | 4380 | 85131 | 741744 | 3535650 | 9972720 | 16967475 | 16936128 | 9034497 | 1968300 | 59246080 | |||||
| 11 | 89 | 7860 | 171963 | 1718928 | 9636975 | 33067440 | 71799210 | 98397504 | 81841914 | 37397700 | 7144929 | 341184512 | ||||
| 12 | 144 | 13968 | 339714 | 3831840 | 24707025 | 99945900 | 264514005 | 463154112 | 528783795 | 375945300 | 150043509 | 25509168 | 1936788480 | |||
| 13 | 233 | 24624 | 659016 | 8279712 | 60363225 | 281379420 | 879451020 | 1879350336 | 2742767001 | 2674919700 | 1657623528 | 586710864 | 89813529 | 10861342208 | ||
| 14 | 377 | 43116 | 1259226 | 17438112 | 141843150 | 748828800 | 2701043415 | 6824979648 | 12165747372 | 15167719800 | 12882306987 | 7066039536 | 2245338225 | 312487308 | 60275075072 | |
| 15 | 610 | 75060 | 2375487 | 35948448 | 322758675 | 1903739760 | 7787178000 | 22734022464 | 47957767281 | 73059359400 | 79308711900 | 59563907280 | 29279210454 | 8437157316 | 1076168025 | 331468380160 |
Compute more
?
Technical details
- Node id
n-8bc628d590897076· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-84e29d07816d0d9d
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 -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, 12; 3: 2, 36, 81; 4: 3, 84, 405, 432; 5: 5, 180, 1296, 3024, 2025; 6: 8, 360, 3483, 12528, 18225, 8748; 7: 13, 696, 8424, 41040, 93150, 96228, 35721; 8: 21, 1308, 19035, 117072, 362475, 586116, 464373, 139968; 9: 34, 2412, 40986, 304560, 1196775, 2650644, 3286332, 2099520, 531441; 10: 55, 4380, 85131, 741744, 3535650, 9972720, 16967475, 16936128, 9034497, 1968300;
%F FormulaThe row polynomials satisfy (25+(225*n-255)*x+(540*n^2-990*n+306)*x^2+(405*n^3-675*n^2-486*n+702)*x^3+(81*n^4-1053*n^2+1134*n+81)*x^4-(243*n^3-243*n^2-243*n+243)*x^5)*P(n,x) = (25+(225*n+45)*x+(540*n^2+765*n-234)*x^2+(405*n^3+2160*n^2-351*n-486)*x^3+(81*n^4+1539*n^3+1053*n^2-2511*n+81)*x^4+(243*n^4+729*n^3-2187*n^2-1944*n+729)*x^5-(729*n^3+1458*n^2)*x^6)*P(n-2,x) + (25+(225*n+45)*x+(540*n^2+450*n-234)*x^2+(405*n^3+1755*n^2-1836*n-486)*x^3+(81*n^4+1377*n^3-486*n^2-3888*n+81)*x^4+(243*n^4+243*n^3-2916*n^2-1215*n+729)*x^5-(729*n^3+729*n^2)*x^6)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 12*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 1 + 12*x;
P[n_, x_] := P[n, x] = Expand[Together[((25 + (225*n + 45)*x + (540*n^2 + 765*n - 234)*x^2 + (405*n^3 + 2160*n^2 - 351*n - 486)*x^3 + (81*n^4 + 1539*n^3 + 1053*n^2 - 2511*n + 81)*x^4 + (243*n^4 + 729*n^3 - 2187*n^2 - 1944*n + 729)*x^5 - (729*n^3 + 1458*n^2)*x^6)*P[n - 2, x] + (25 + (225*n + 45)*x + (540*n^2 + 450*n - 234)*x^2 + (405*n^3 + 1755*n^2 - 1836*n - 486)*x^3 + (81*n^4 + 1377*n^3 - 486*n^2 - 3888*n + 81)*x^4 + (243*n^4 + 243*n^3 - 2916*n^2 - 1215*n + 729)*x^5 - (729*n^3 + 729*n^2)*x^6)*P[n - 1, x])/(25 + (225*n - 255)*x + (540*n^2 - 990*n + 306)*x^2 + (405*n^3 - 675*n^2 - 486*n + 702)*x^3 + (81*n^4 - 1053*n^2 + 1134*n + 81)*x^4 - (243*n^3 - 243*n^2 - 243*n + 243)*x^5)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 12*x; for(n = 3, N, my(i = n); v[i] = ((25 + (225*n + 45)*x + (540*n^2 + 765*n - 234)*x^2 + (405*n^3 + 2160*n^2 - 351*n - 486)*x^3 + (81*n^4 + 1539*n^3 + 1053*n^2 - 2511*n + 81)*x^4 + (243*n^4 + 729*n^3 - 2187*n^2 - 1944*n + 729)*x^5 - (729*n^3 + 1458*n^2)*x^6)*v[i - 2] + (25 + (225*n + 45)*x + (540*n^2 + 450*n - 234)*x^2 + (405*n^3 + 1755*n^2 - 1836*n - 486)*x^3 + (81*n^4 + 1377*n^3 - 486*n^2 - 3888*n + 81)*x^4 + (243*n^4 + 243*n^3 - 2916*n^2 - 1215*n + 729)*x^5 - (729*n^3 + 729*n^2)*x^6)*v[i - 1])/(25 + (225*n - 255)*x + (540*n^2 - 990*n + 306)*x^2 + (405*n^3 - 675*n^2 - 486*n + 702)*x^3 + (81*n^4 - 1053*n^2 + 1134*n + 81)*x^4 - (243*n^3 - 243*n^2 - 243*n + 243)*x^5)); 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
basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Geometric basis map (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.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
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.