A094638 → θ+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} + n + 2\,n x + n x^{2}\right)\,P_{n}(x) = \left(-n - 2\,n x - n x^{2} - 2\,n^{2} x - 4\,n^{2} x^{2} - 2\,n^{2} x^{3} - n^{3} x^{2} - 2\,n^{3} x^{3} - n^{3} x^{4}\right)\,P_{n-2}(x) + \left(-1 - 3\,x - 3\,x^{2} - x^{3} + 2\,n + 4\,n x + 2\,n x^{2} + 2\,n^{2} x + 4\,n^{2} x^{2} + 2\,n^{2} x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 3 | 4 | |||||||||||||
| 2 | 1 | 8 | 13 | 22 | ||||||||||||
| 3 | 1 | 15 | 60 | 70 | 146 | |||||||||||
| 4 | 1 | 24 | 171 | 474 | 446 | 1116 | ||||||||||
| 5 | 1 | 35 | 385 | 1855 | 4060 | 3276 | 9612 | |||||||||
| 6 | 1 | 48 | 750 | 5480 | 20525 | 37960 | 27252 | 92016 | ||||||||
| 7 | 1 | 63 | 1323 | 13545 | 76020 | 237888 | 387128 | 253296 | 969264 | |||||||
| 8 | 1 | 80 | 2170 | 29540 | 230125 | 1069460 | 2919000 | 4291560 | 2602224 | 11144160 | ||||||
| 9 | 1 | 99 | 3366 | 58674 | 603141 | 3862551 | 15545684 | 38062596 | 51491088 | 29288160 | 138915360 | |||||
| 10 | 1 | 120 | 4995 | 108360 | 1417395 | 11905992 | 65645405 | 235622760 | 527717004 | 665688528 | 358457760 | 1866568320 | ||||
| 11 | 1 | 143 | 7150 | 188760 | 3056625 | 32507475 | 233937704 | 1144682110 | 3739828664 | 7771492872 | 9233617536 | 4740577920 | 26899896960 | |||
| 12 | 1 | 168 | 9933 | 313390 | 6148065 | 80599596 | 731298491 | 4650991422 | 20628418734 | 62268024896 | 121352444136 | 136866901248 | 67375532160 | 413960682240 | ||
| 13 | 1 | 195 | 13455 | 499785 | 11672375 | 184703805 | 2058367025 | 16445970255 | 94467759672 | 385709970360 | 1087910858320 | 2005073843760 | 2159996746752 | 1024208720640 | 6776069126400 | |
| 14 | 1 | 224 | 17836 | 770224 | 21107086 | 396347952 | 5314737428 | 51993424912 | 374025717065 | 1971588482864 | 7497985430936 | 19935414180864 | 34978276586448 | 36172182908160 | 16583626886400 | 117570826598400 |
Compute more
?
Technical details
- Node id
n-96631c9ffb8654db· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-c5be635e87f1100d
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: 1, 3; 2: 1, 8, 13; 3: 1, 15, 60, 70; 4: 1, 24, 171, 474, 446; 5: 1, 35, 385, 1855, 4060, 3276; 6: 1, 48, 750, 5480, 20525, 37960, 27252; 7: 1, 63, 1323, 13545, 76020, 237888, 387128, 253296; 8: 1, 80, 2170, 29540, 230125, 1069460, 2919000, 4291560, 2602224; 9: 1, 99, 3366, 58674, 603141, 3862551, 15545684, 38062596, 51491088, 29288160;
%F FormulaThe row polynomials satisfy (n-1+(2*n-2)*x+(n-1)*x^2)*P(n,x) = -(n+(2*n^2+2*n)*x+(n^3+4*n^2+n)*x^2+(2*n^3+2*n^2)*x^3+n^3*x^4)*P(n-2,x) + (2*n-1+(2*n^2+4*n-3)*x+(4*n^2+2*n-3)*x^2+(2*n^2-1)*x^3)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n + (2*n^2 + 2*n)*x + (n^3 + 4*n^2 + n)*x^2 + (2*n^3 + 2*n^2)*x^3 + n^3*x^4)*P[n - 2, x] + (2*n - 1 + (2*n^2 + 4*n - 3)*x + (4*n^2 + 2*n - 3)*x^2 + (2*n^2 - 1)*x^3)*P[n - 1, x])/(n - 1 + (2*n - 2)*x + (n - 1)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n + (2*n^2 + 2*n)*x + (n^3 + 4*n^2 + n)*x^2 + (2*n^3 + 2*n^2)*x^3 + n^3*x^4)*v[i - 2] + (2*n - 1 + (2*n^2 + 4*n - 3)*x + (4*n^2 + 2*n - 3)*x^2 + (2*n^2 - 1)*x^3)*v[i - 1])/(n - 1 + (2*n - 2)*x + (n - 1)*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
theta_plus_one of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the fir…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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…?
-
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 ›
- ↑ 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…?
- ↑ 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…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the fir…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.