A008277 → θ+2 (shift +1) → reverse → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + 3\,x + 3\,x^{2} + x^{3}\right)\,P_{n}(x) = \left(-1 - 2\,x + 3\,x^{2} + 11\,x^{3} + 10\,x^{4} + 3\,x^{5} - n x - 4\,n x^{2} - 6\,n x^{3} - 4\,n x^{4} - n x^{5}\right)\,P_{n-2}(x) + \left(x^{2} + 4\,x^{3} + 6\,x^{4} + 4\,x^{5} + x^{6}\right)\,P_{n-2}'(x) + \left(2 + 7\,x + 8\,x^{2} + 2\,x^{3} - 2\,x^{4} - x^{5} + n x + 4\,n x^{2} + 6\,n x^{3} + 4\,n x^{4} + n x^{5}\right)\,P_{n-1}(x) + \left(-x^{2} - 4\,x^{3} - 6\,x^{4} - 4\,x^{5} - x^{6}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 3 + 5\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 2 | 2 | ||||||||||||||
| 1 | 3 | 5 | 8 | |||||||||||||
| 2 | 4 | 17 | 15 | 36 | ||||||||||||
| 3 | 5 | 39 | 84 | 52 | 180 | |||||||||||
| 4 | 6 | 74 | 286 | 419 | 203 | 988 | ||||||||||
| 5 | 7 | 125 | 755 | 1945 | 2183 | 877 | 5892 | |||||||||
| 6 | 8 | 195 | 1695 | 6740 | 13084 | 11990 | 4140 | 37852 | ||||||||
| 7 | 9 | 287 | 3395 | 19285 | 57120 | 89348 | 69541 | 21147 | 260132 | |||||||
| 8 | 10 | 404 | 6244 | 48062 | 201796 | 476714 | 626630 | 425473 | 115975 | 1901308 | ||||||
| 9 | 11 | 549 | 10746 | 107814 | 610365 | 2028831 | 3992189 | 4538031 | 2740482 | 678570 | 14707588 | |||||
| 10 | 12 | 725 | 17535 | 222540 | 1637076 | 7299159 | 20070315 | 33893540 | 34016104 | 18538673 | 4213597 | 119909276 | ||||
| 11 | 13 | 935 | 27390 | 429330 | 3987753 | 23022615 | 84479395 | 198111485 | 293442215 | 264124817 | 131396851 | 27644437 | 1026667236 | |||
| 12 | 14 | 1182 | 41250 | 783145 | 8975175 | 65275716 | 309003332 | 962272674 | 1968149106 | 2599532584 | 2124312568 | 973515464 | 190899322 | 9202761532 | ||
| 13 | 15 | 1469 | 60229 | 1362647 | 18906602 | 169421538 | 1007725290 | 4033401086 | 10904309702 | 19787095042 | 23608228748 | 17688315996 | 7523325735 | 1382958545 | 86125112644 | |
| 14 | 16 | 1799 | 85631 | 2277184 | 37649612 | 408124717 | 2985790093 | 14974751792 | 51843103312 | 123815395704 | 202033686036 | 220020637564 | 152362358880 | 60521626965 | 10480142147 | 839485631452 |
Compute more
?
Technical details
- Node id
n-65cdfe9ba679f791· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-1b51648b831a15d9
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: 2; 1: 3, 5; 2: 4, 17, 15; 3: 5, 39, 84, 52; 4: 6, 74, 286, 419, 203; 5: 7, 125, 755, 1945, 2183, 877; 6: 8, 195, 1695, 6740, 13084, 11990, 4140; 7: 9, 287, 3395, 19285, 57120, 89348, 69541, 21147; 8: 10, 404, 6244, 48062, 201796, 476714, 626630, 425473, 115975; 9: 11, 549, 10746, 107814, 610365, 2028831, 3992189, 4538031, 2740482, 678570;
%F FormulaThe row polynomials satisfy (1+3*x+3*x^2+x^3)*P(n,x) = -(1+(n+2)*x+(4*n-3)*x^2+(6*n-11)*x^3+(4*n-10)*x^4+(n-3)*x^5)*P(n-2,x) + (x^2+4*x^3+6*x^4+4*x^5+x^6)*d/dx P(n-2,x) + (2+(n+7)*x+(4*n+8)*x^2+(6*n+2)*x^3+(4*n-2)*x^4+(n-1)*x^5)*P(n-1,x) - (x^2+4*x^3+6*x^4+4*x^5+x^6)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 3 + 5*x.
%t MathematicaP[0, x_] := 2;
P[1, x_] := 3 + 5*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(1 + (n + 2)*x + (4*n - 3)*x^2 + (6*n - 11)*x^3 + (4*n - 10)*x^4 + (n - 3)*x^5)*P[n - 2, x] + (x^2 + 4*x^3 + 6*x^4 + 4*x^5 + x^6)*D[P[n - 2, x], x] + (2 + (n + 7)*x + (4*n + 8)*x^2 + (6*n + 2)*x^3 + (4*n - 2)*x^4 + (n - 1)*x^5)*P[n - 1, x] - (x^2 + 4*x^3 + 6*x^4 + 4*x^5 + x^6)*D[P[n - 1, x], x])/(1 + 3*x + 3*x^2 + x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 3 + 5*x; for(n = 2, N, my(i = n + 1); v[i] = (-(1 + (n + 2)*x + (4*n - 3)*x^2 + (6*n - 11)*x^3 + (4*n - 10)*x^4 + (n - 3)*x^5)*v[i - 2] + (x^2 + 4*x^3 + 6*x^4 + 4*x^5 + x^6)*deriv(v[i - 2], x) + (2 + (n + 7)*x + (4*n + 8)*x^2 + (6*n + 2)*x^3 + (4*n - 2)*x^4 + (n - 1)*x^5)*v[i - 1] - (x^2 + 4*x^3 + 6*x^4 + 4*x^5 + x^6)*deriv(v[i - 1], x))/(1 + 3*x + 3*x^2 + 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 [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.?
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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.