A089231 → x ↦ x+1 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + 2\,x + x^{2}\right)\,P_{n}(x) = \left(-3\,x - 10\,x^{2} - 11\,x^{3} - 4\,x^{4} + 3\,n + 14\,n x + 23\,n x^{2} + 16\,n x^{3} + 4\,n x^{4}\right)\,P_{n-1}(x) + \left(-1 - 7\,x - 19\,x^{2} - 25\,x^{3} - 16\,x^{4} - 4\,x^{5}\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 | 3 | 5 | 8 | |||||||||||||
| 2 | 13 | 44 | 37 | 94 | ||||||||||||
| 3 | 73 | 375 | 639 | 361 | 1448 | |||||||||||
| 4 | 501 | 3464 | 8946 | 10224 | 4361 | 27496 | ||||||||||
| 5 | 4051 | 35285 | 122530 | 211990 | 182675 | 62701 | 619232 | |||||||||
| 6 | 37633 | 395940 | 1730835 | 4023200 | 5243295 | 3631788 | 1044205 | 16106896 | ||||||||
| 7 | 394353 | 4867919 | 25690077 | 75125715 | 131450515 | 137595213 | 79761759 | 19748177 | 474633728 | |||||||
| 8 | 4596553 | 65165840 | 403325524 | 1423212896 | 3131278990 | 4397910608 | 3850097860 | 1920434624 | 417787921 | 15613810816 | ||||||
| 9 | 58941091 | 944159589 | 6709101156 | 27754335084 | 73653792786 | 130016814606 | 152646535524 | 114921201996 | 50335190019 | 9770678101 | 566810749952 | |||||
| 10 | 824073141 | 14724251420 | 118187908785 | 561168132480 | 1745288446650 | 3714729577272 | 5479249582170 | 5529731033760 | 3653815665105 | 1427166914700 | 250194150581 | 22495079736064 | ||||
| 11 | 12470162233 | 245949439175 | 2201547789595 | 11804911355325 | 42128371082490 | 105055334507046 | 186779385207030 | 236736838697370 | 209608981405725 | 123458956890115 | 43530394652063 | 6959638411705 | 968522779599872 | |||
| 12 | 202976401213 | 4381062122904 | 43279897931622 | 258746811497680 | 1042571868727455 | 2982520167737616 | 6211045559543748 | 9486265349937024 | 10545284198309355 | 8320015321392280 | 4421964323903478 | 1421333655775344 | 208919770666777 | 44946530963946496 | ||
| 13 | 3535017524403 | 82896932838005 | 896058250212294 | 5911194058630146 | 26550965069719805 | 85741353147175011 | 204791582617607700 | 366278767165745148 | 490521612085376157 | 485761087168798155 | 345728713716858758 | 167453058918273570 | 49465736932304979 | 6729933476435261 | 2235916494557499392 | |
| 14 | 65573803186921 | 1660386924741524 | 19496692958810431 | 140710849350102304 | 697292523790864001 | 2509725580509959812 | 6765535730916065103 | 13875788313860876832 | 21756132412729077363 | 25949592557144828572 | 23175779109117175541 | 15027831483364458304 | 6687386401910902051 | 1827890581508142284 | 231512615111396221 | 118666400813000587264 |
Compute more
?
Technical details
- Node id
n-ceee4247cb96ddbf· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-452f0d62820ccb13
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: 3, 5; 2: 13, 44, 37; 3: 73, 375, 639, 361; 4: 501, 3464, 8946, 10224, 4361; 5: 4051, 35285, 122530, 211990, 182675, 62701; 6: 37633, 395940, 1730835, 4023200, 5243295, 3631788, 1044205; 7: 394353, 4867919, 25690077, 75125715, 131450515, 137595213, 79761759, 19748177; 8: 4596553, 65165840, 403325524, 1423212896, 3131278990, 4397910608, 3850097860, 1920434624, 417787921; 9: 58941091, 944159589, 6709101156, 27754335084, 73653792786, 130016814606, 152646535524, 114921201996, 50335190019, 9770678101;
%F FormulaThe row polynomials satisfy (1+2*x+x^2)*P(n,x) = (3*n+(14*n-3)*x+(23*n-10)*x^2+(16*n-11)*x^3+(4*n-4)*x^4)*P(n-1,x) - (1+7*x+19*x^2+25*x^3+16*x^4+4*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[((3*n + (14*n - 3)*x + (23*n - 10)*x^2 + (16*n - 11)*x^3 + (4*n - 4)*x^4)*P[n - 1, x] - (1 + 7*x + 19*x^2 + 25*x^3 + 16*x^4 + 4*x^5)*D[P[n - 1, x], x])/(1 + 2*x + 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] = ((3*n + (14*n - 3)*x + (23*n - 10)*x^2 + (16*n - 11)*x^3 + (4*n - 4)*x^4)*v[i - 1] - (1 + 7*x + 19*x^2 + 25*x^3 + 16*x^4 + 4*x^5)*deriv(v[i - 1], x))/(1 + 2*x + 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 [-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
Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangular array A066667 or A008297 unsigned and transposed.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A008277 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+…?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
-
from
T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.?
-
-
from
basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
-
from
basis_map_A008277 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+…?
-
-
from
Triangular array A066667 or A008297 unsigned and transposed.?
-
-
from
Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.?
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.