A143494 → 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 + 2\,x + x^{2}\right)\,P_{n}(x) = \left(1 + 3\,x + x^{2} - 3\,x^{3} - 2\,x^{4} + n x + 3\,n x^{2} + 3\,n x^{3} + n x^{4}\right)\,P_{n-1}(x) + \left(-x^{2} - 3\,x^{3} - 3\,x^{4} - x^{5}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 1 | 3 | 4 | |||||||||||||
| 3 | 1 | 7 | 10 | 18 | ||||||||||||
| 4 | 1 | 12 | 40 | 37 | 90 | |||||||||||
| 5 | 1 | 18 | 103 | 221 | 151 | 494 | ||||||||||
| 6 | 1 | 25 | 215 | 790 | 1241 | 674 | 2946 | |||||||||
| 7 | 1 | 33 | 395 | 2180 | 5836 | 7218 | 3263 | 18926 | ||||||||
| 8 | 1 | 42 | 665 | 5110 | 20496 | 42938 | 43807 | 17007 | 130066 | |||||||
| 9 | 1 | 52 | 1050 | 10682 | 59591 | 186354 | 319985 | 278111 | 94828 | 950654 | ||||||
| 10 | 1 | 63 | 1578 | 20496 | 151347 | 656901 | 1676473 | 2437098 | 1847242 | 562595 | 7353794 | |||||
| 11 | 1 | 75 | 2280 | 36780 | 346857 | 1990653 | 7031515 | 15123540 | 19062151 | 12825759 | 3535027 | 59954638 | ||||
| 12 | 1 | 88 | 3190 | 62535 | 732897 | 5369826 | 25037881 | 74297410 | 137929451 | 153507134 | 92962365 | 23430840 | 513333618 | |||
| 13 | 1 | 102 | 4345 | 101695 | 1449492 | 13199076 | 78496594 | 306819414 | 783200726 | 1278273480 | 1274286388 | 702294568 | 163254885 | 4601380766 | ||
| 14 | 1 | 117 | 5785 | 159302 | 2713282 | 30058743 | 222083290 | 1105682292 | 3708735602 | 8294775632 | 12076730172 | 10908546948 | 5521005933 | 1192059223 | 43062556322 | |
| 15 | 1 | 133 | 7553 | 241696 | 4847843 | 64211147 | 577149001 | 3566985136 | 15214459260 | 44598754200 | 88683837606 | 116548030508 | 96293931189 | 45093176851 | 9097183602 | 419742815726 |
Compute more
?
Technical details
- Node id
n-ae9866a8d80553e2· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-f80b58a897df2b0a
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 -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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 3; 3: 1, 7, 10; 4: 1, 12, 40, 37; 5: 1, 18, 103, 221, 151; 6: 1, 25, 215, 790, 1241, 674; 7: 1, 33, 395, 2180, 5836, 7218, 3263; 8: 1, 42, 665, 5110, 20496, 42938, 43807, 17007; 9: 1, 52, 1050, 10682, 59591, 186354, 319985, 278111, 94828; 10: 1, 63, 1578, 20496, 151347, 656901, 1676473, 2437098, 1847242, 562595;
%F FormulaThe row polynomials satisfy (1+2*x+x^2)*P(n,x) = (1+(n+3)*x+(3*n+1)*x^2+(3*n-3)*x^3+(n-2)*x^4)*P(n-1,x) - (x^2+3*x^3+3*x^4+x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((1 + (n + 3)*x + (3*n + 1)*x^2 + (3*n - 3)*x^3 + (n - 2)*x^4)*P[n - 1, x] - (x^2 + 3*x^3 + 3*x^4 + x^5)*D[P[n - 1, x], x])/(1 + 2*x + x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((1 + (n + 3)*x + (3*n + 1)*x^2 + (3*n - 3)*x^3 + (n - 2)*x^4)*v[i - 1] - (x^2 + 3*x^3 + 3*x^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, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] 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.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Ray basis map theorem (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
Related ?
Candidate equalities ?
- A143494 → x ↦ x+1 → reverse 15 rows; no all-index equality certificate was found
Same fingerprint ?
- A137597 → D+1
- A126351 → x ↦ x/(x+1)
- A137597 → D+1 → reverse
- A143494 → x ↦ x+1
- A156992 → basis A008277 → x ↦ x+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.