A249139 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(26 + 32\,x + 6\,x^{2} + 26\,n + 45\,n x + 15\,n x^{2} + 13\,n^{2} x + 12\,n^{2} x^{2} + 3\,n^{3} x^{2}\right)\,P_{n}(x) = \left(26 + 32\,x + 6\,x^{2} + 182\,n + 510\,n x + 435\,n x^{2} + 108\,n x^{3} + 130\,n^{2} x + 222\,n^{2} x^{2} + 90\,n^{2} x^{3} + 21\,n^{3} x^{2} + 18\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-169 - 741\,x - 1190\,x^{2} - 834\,x^{3} - 216\,x^{4} - 169\,n x - 520\,n x^{2} - 531\,n x^{3} - 180\,n x^{4} - 39\,n^{2} x^{2} - 75\,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 | 4 | 6 | 10 | ||||||
| 2 | 7 | 12 | 19 | ||||||
| 3 | 19 | 54 | 27 | 100 | |||||
| 4 | 40 | 132 | 81 | 253 | |||||
| 5 | 97 | 408 | 405 | 108 | 1018 | ||||
| 6 | 217 | 1044 | 1242 | 432 | 2935 | ||||
| 7 | 508 | 2850 | 4293 | 2376 | 405 | 10432 | |||
| 8 | 1159 | 7284 | 12717 | 8640 | 2025 | 31825 | |||
| 9 | 2683 | 18882 | 38421 | 32940 | 12150 | 1458 | 106534 | ||
| 10 | 6160 | 47688 | 109350 | 109728 | 50625 | 8748 | 332299 | ||
| 11 | 14209 | 120432 | 309582 | 362232 | 210600 | 56862 | 5103 | 1079020 | |
| 12 | 32689 | 300456 | 852228 | 1128816 | 773955 | 265356 | 35721 | 3389221 | |
| 13 | 75316 | 747006 | 2322918 | 3453840 | 2764125 | 1194102 | 250047 | 17496 | 10824850 |
| 14 | 173383 | 1844508 | 6231654 | 10249200 | 9319050 | 4776408 | 1285956 | 139968 | 34020127 |
Compute more
?
Technical details
- Node id
n-b569f4a0f2c54d5e· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-8126c1326009a233
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: 4, 6; 2: 7, 12; 3: 19, 54, 27; 4: 40, 132, 81; 5: 97, 408, 405, 108; 6: 217, 1044, 1242, 432; 7: 508, 2850, 4293, 2376, 405; 8: 1159, 7284, 12717, 8640, 2025; 9: 2683, 18882, 38421, 32940, 12150, 1458;
%F FormulaThe row polynomials satisfy (26*n+26+(13*n^2+45*n+32)*x+(3*n^3+12*n^2+15*n+6)*x^2)*P(n,x) = (182*n+26+(130*n^2+510*n+32)*x+(21*n^3+222*n^2+435*n+6)*x^2+(18*n^3+90*n^2+108*n)*x^3)*P(n-1,x) - (169+(169*n+741)*x+(39*n^2+520*n+1190)*x^2+(75*n^2+531*n+834)*x^3+(36*n^2+180*n+216)*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[((182*n + 26 + (130*n^2 + 510*n + 32)*x + (21*n^3 + 222*n^2 + 435*n + 6)*x^2 + (18*n^3 + 90*n^2 + 108*n)*x^3)*P[n - 1, x] - (169 + (169*n + 741)*x + (39*n^2 + 520*n + 1190)*x^2 + (75*n^2 + 531*n + 834)*x^3 + (36*n^2 + 180*n + 216)*x^4)*D[P[n - 1, x], x])/(26*n + 26 + (13*n^2 + 45*n + 32)*x + (3*n^3 + 12*n^2 + 15*n + 6)*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] = ((182*n + 26 + (130*n^2 + 510*n + 32)*x + (21*n^3 + 222*n^2 + 435*n + 6)*x^2 + (18*n^3 + 90*n^2 + 108*n)*x^3)*v[i - 1] - (169 + (169*n + 741)*x + (39*n^2 + 520*n + 1190)*x^2 + (75*n^2 + 531*n + 834)*x^3 + (36*n^2 + 180*n + 216)*x^4)*deriv(v[i - 1], x))/(26*n + 26 + (13*n^2 + 45*n + 32)*x + (3*n^3 + 12*n^2 + 15*n + 6)*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 Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Co…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
-
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 ›
-
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 ›
-
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).?
-
-
from
Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.?
-
-
from
basis_map_A013610 of Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Co…?
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.