A128100 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(12\,n + 13\,n x + 9\,n^{2} x + 3\,n^{2} x^{2} + 3\,n^{3} x^{2}\right)\,P_{n}(x) = \left(-48 - 160\,x - 156\,x^{2} - 36\,x^{3} + 60\,n + 119\,n x + 36\,n x^{2} - 18\,n x^{3} + 63\,n^{2} x + 111\,n^{2} x^{2} + 36\,n^{2} x^{3} + 15\,n^{3} x^{2} + 18\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-36 - 180\,x - 329\,x^{2} - 258\,x^{3} - 72\,x^{4} - 54\,n x - 207\,n x^{2} - 261\,n x^{3} - 108\,n x^{4} - 18\,n^{2} x^{2} - 51\,n^{2} x^{3} - 36\,n^{2} x^{4}\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 | 1 | 1 | |||||||
| 2 | 3 | 6 | 9 | ||||||
| 3 | 5 | 12 | 17 | ||||||
| 4 | 11 | 42 | 27 | 80 | |||||
| 5 | 21 | 96 | 81 | 198 | |||||
| 6 | 43 | 246 | 324 | 108 | 721 | ||||
| 7 | 85 | 564 | 918 | 432 | 1999 | ||||
| 8 | 171 | 1314 | 2673 | 1944 | 405 | 6507 | |||
| 9 | 341 | 2952 | 7047 | 6480 | 2025 | 18845 | |||
| 10 | 683 | 6606 | 18306 | 21060 | 10125 | 1458 | 58238 | ||
| 11 | 1365 | 14556 | 45684 | 62208 | 38475 | 8748 | 171036 | ||
| 12 | 2731 | 31866 | 112023 | 177552 | 137700 | 48114 | 5103 | 515089 | |
| 13 | 5461 | 69168 | 268893 | 484704 | 447930 | 204120 | 35721 | 1515997 | |
| 14 | 10923 | 149286 | 636336 | 1287900 | 1389150 | 796068 | 214326 | 17496 | 4501485 |
Compute more
?
Technical details
- Node id
n-8e9bf83669ab8f85· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-d302b8af0fc2f5e8
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 0)
- 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: 1; 2: 3, 6; 3: 5, 12; 4: 11, 42, 27; 5: 21, 96, 81; 6: 43, 246, 324, 108; 7: 85, 564, 918, 432; 8: 171, 1314, 2673, 1944, 405; 9: 341, 2952, 7047, 6480, 2025;
%F FormulaThe row polynomials satisfy (12*n+(9*n^2+13*n)*x+(3*n^3+3*n^2)*x^2)*P(n,x) = (60*n-48+(63*n^2+119*n-160)*x+(15*n^3+111*n^2+36*n-156)*x^2+(18*n^3+36*n^2-18*n-36)*x^3)*P(n-1,x) - (36+(54*n+180)*x+(18*n^2+207*n+329)*x^2+(51*n^2+261*n+258)*x^3+(36*n^2+108*n+72)*x^4)*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[((60*n - 48 + (63*n^2 + 119*n - 160)*x + (15*n^3 + 111*n^2 + 36*n - 156)*x^2 + (18*n^3 + 36*n^2 - 18*n - 36)*x^3)*P[n - 1, x] - (36 + (54*n + 180)*x + (18*n^2 + 207*n + 329)*x^2 + (51*n^2 + 261*n + 258)*x^3 + (36*n^2 + 108*n + 72)*x^4)*D[P[n - 1, x], x])/(12*n + (9*n^2 + 13*n)*x + (3*n^3 + 3*n^2)*x^2)]];
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] = ((60*n - 48 + (63*n^2 + 119*n - 160)*x + (15*n^3 + 111*n^2 + 36*n - 156)*x^2 + (18*n^3 + 36*n^2 - 18*n - 36)*x^3)*v[i - 1] - (36 + (54*n + 180)*x + (18*n^2 + 207*n + 329)*x^2 + (51*n^2 + 261*n + 258)*x^3 + (36*n^2 + 108*n + 72)*x^4)*deriv(v[i - 1], x))/(12*n + (9*n^2 + 13*n)*x + (3*n^3 + 3*n^2)*x^2)); 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
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
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, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.