A030528 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(30 + 72\,x + 30\,n + 117\,n x + 27\,n x^{2} - 81\,n x^{3} + 45\,n^{2} x + 54\,n^{2} x^{2} - 81\,n^{2} x^{3} + 27\,n^{3} x^{2}\right)\,P_{n}(x) = \left(180 + 612\,x + 594\,x^{2} - 324\,x^{3} - 486\,x^{4} - 60\,n + 351\,n x + 972\,n x^{2} + 243\,n x^{3} - 486\,n x^{4} - 135\,n^{2} x + 108\,n^{2} x^{2} + 405\,n^{2} x^{3} - 54\,n^{3} x^{2}\right)\,P_{n-1}(x) + \left(25 + 135\,x + 162\,x^{2} - 216\,x^{3} - 567\,x^{4} - 243\,x^{5} + 75\,n x + 315\,n x^{2} + 162\,n x^{3} - 405\,n x^{4} - 243\,n x^{5} + 45\,n^{2} x^{2} + 162\,n^{2} x^{3} + 81\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 6 | 8 | |||||||||||||
| 2 | 3 | 24 | 27 | 54 | ||||||||||||
| 3 | 5 | 60 | 162 | 108 | 335 | |||||||||||
| 4 | 8 | 132 | 567 | 864 | 405 | 1976 | ||||||||||
| 5 | 13 | 270 | 1593 | 3888 | 4050 | 1458 | 11272 | |||||||||
| 6 | 21 | 528 | 3969 | 13392 | 22275 | 17496 | 5103 | 62784 | ||||||||
| 7 | 34 | 1002 | 9153 | 39528 | 91125 | 113724 | 71442 | 17496 | 343504 | |||||||
| 8 | 55 | 1860 | 20007 | 105408 | 311850 | 539460 | 535815 | 279936 | 59049 | 1853440 | ||||||
| 9 | 89 | 3396 | 42039 | 261576 | 946485 | 2103894 | 2893401 | 2379456 | 1062882 | 196830 | 9890048 | |||||
| 10 | 144 | 6120 | 85698 | 615168 | 2634525 | 7173360 | 12680955 | 14416704 | 10097379 | 3936600 | 649539 | 52296192 | ||||
| 11 | 233 | 10914 | 170559 | 1387692 | 6868800 | 22168890 | 48044745 | 70193952 | 67847301 | 41334300 | 14289858 | 2125764 | 274443008 | |||
| 12 | 377 | 19296 | 332910 | 3027888 | 17014050 | 63554220 | 163423575 | 292813056 | 363505644 | 305086500 | 164333367 | 51018336 | 6908733 | 1431037952 | ||
| 13 | 610 | 33870 | 639414 | 6429456 | 40441275 | 171701370 | 511499205 | 1088041248 | 1656501597 | 1784263950 | 1321811865 | 637729200 | 179627058 | 22320522 | 7421040640 | |
| 14 | 987 | 59088 | 1211571 | 13346640 | 92920365 | 442094760 | 1498317345 | 3694875264 | 6680390517 | 8822707920 | 8381001717 | 5552495568 | 2424965283 | 624974616 | 71744535 | 38301106176 |
Compute more
?
Technical details
- Node id
n-83cc2466332c48a7· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-a99eed42e26d3f2e
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 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: 2, 6; 2: 3, 24, 27; 3: 5, 60, 162, 108; 4: 8, 132, 567, 864, 405; 5: 13, 270, 1593, 3888, 4050, 1458; 6: 21, 528, 3969, 13392, 22275, 17496, 5103; 7: 34, 1002, 9153, 39528, 91125, 113724, 71442, 17496; 8: 55, 1860, 20007, 105408, 311850, 539460, 535815, 279936, 59049; 9: 89, 3396, 42039, 261576, 946485, 2103894, 2893401, 2379456, 1062882, 196830;
%F FormulaThe row polynomials satisfy (30*n+30+(45*n^2+117*n+72)*x+(27*n^3+54*n^2+27*n)*x^2-(81*n^2+81*n)*x^3)*P(n,x) = -(60*n-180+(135*n^2-351*n-612)*x+(54*n^3-108*n^2-972*n-594)*x^2-(405*n^2+243*n-324)*x^3+(486*n+486)*x^4)*P(n-1,x) + (25+(75*n+135)*x+(45*n^2+315*n+162)*x^2+(162*n^2+162*n-216)*x^3+(81*n^2-405*n-567)*x^4-(243*n+243)*x^5)*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 - 180 + (135*n^2 - 351*n - 612)*x + (54*n^3 - 108*n^2 - 972*n - 594)*x^2 - (405*n^2 + 243*n - 324)*x^3 + (486*n + 486)*x^4)*P[n - 1, x] + (25 + (75*n + 135)*x + (45*n^2 + 315*n + 162)*x^2 + (162*n^2 + 162*n - 216)*x^3 + (81*n^2 - 405*n - 567)*x^4 - (243*n + 243)*x^5)*D[P[n - 1, x], x])/(30*n + 30 + (45*n^2 + 117*n + 72)*x + (27*n^3 + 54*n^2 + 27*n)*x^2 - (81*n^2 + 81*n)*x^3)]];
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 - 180 + (135*n^2 - 351*n - 612)*x + (54*n^3 - 108*n^2 - 972*n - 594)*x^2 - (405*n^2 + 243*n - 324)*x^3 + (486*n + 486)*x^4)*v[i - 1] + (25 + (75*n + 135)*x + (45*n^2 + 315*n + 162)*x^2 + (162*n^2 + 162*n - 216)*x^3 + (81*n^2 - 405*n - 567)*x^4 - (243*n + 243)*x^5)*deriv(v[i - 1], x))/(30*n + 30 + (45*n^2 + 117*n + 72)*x + (27*n^3 + 54*n^2 + 27*n)*x^2 - (81*n^2 + 81*n)*x^3)); 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) = binomial(k,n-k).?
-
Geometric basis map (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).?
-
Geometric basis map (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).?
-
Geometric basis map (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
basis_map_A013610 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
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.