A125092 → D+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 + 4\,x + 6\,x^{2} + 4\,x^{3} + x^{4}\right)\,P_{n}(x) = \left(-1 - 12\,x - 62\,x^{2} - 180\,x^{3} - 321\,x^{4} - 360\,x^{5} - 248\,x^{6} - 96\,x^{7} - 16\,x^{8}\right)\,P_{n-4}(x) + \left(4 + 40\,x + 168\,x^{2} + 384\,x^{3} + 516\,x^{4} + 408\,x^{5} + 176\,x^{6} + 32\,x^{7}\right)\,P_{n-3}(x) + \left(-6 - 48\,x - 156\,x^{2} - 264\,x^{3} - 246\,x^{4} - 120\,x^{5} - 24\,x^{6}\right)\,P_{n-2}(x) + \left(4 + 24\,x + 56\,x^{2} + 64\,x^{3} + 36\,x^{4} + 8\,x^{5}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + 9\,x\)
\(P_{2}(x) = 9 + 44\,x + 44\,x^{2}\)
\(P_{3}(x) = 13 + 105\,x + 246\,x^{2} + 170\,x^{3}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 5 | 9 | 14 | ||||||
| 2 | 9 | 44 | 44 | 97 | |||||
| 3 | 13 | 105 | 246 | 170 | 534 | ||||
| 4 | 17 | 192 | 720 | 1096 | 576 | 2601 | |||
| 5 | 21 | 305 | 1580 | 3780 | 4240 | 1792 | 11718 | ||
| 6 | 25 | 444 | 2940 | 9640 | 16800 | 14880 | 5248 | 49977 | |
| 7 | 29 | 609 | 4914 | 20510 | 48720 | 66528 | 48608 | 14688 | 204606 |
Compute more
?
Technical details
- Node id
n-4da38e15832834ab· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-3d2cf55da338f373
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: 5, 9; 2: 9, 44, 44; 3: 13, 105, 246, 170; 4: 17, 192, 720, 1096, 576; 5: 21, 305, 1580, 3780, 4240, 1792; 6: 25, 444, 2940, 9640, 16800, 14880, 5248; 7: 29, 609, 4914, 20510, 48720, 66528, 48608, 14688; 8: 33, 800, 7616, 38640, 116480, 215936, 241920, 150272, 39680; 9: 37, 1017, 11160, 66696, 243936, 572544, 868224, 823680, 444672, 104192;
%F FormulaThe row polynomials satisfy (1+4*x+6*x^2+4*x^3+x^4)*P(n,x) = -(1+12*x+62*x^2+180*x^3+321*x^4+360*x^5+248*x^6+96*x^7+16*x^8)*P(n-4,x) + (4+40*x+168*x^2+384*x^3+516*x^4+408*x^5+176*x^6+32*x^7)*P(n-3,x) - (6+48*x+156*x^2+264*x^3+246*x^4+120*x^5+24*x^6)*P(n-2,x) + (4+24*x+56*x^2+64*x^3+36*x^4+8*x^5)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 5 + 9*x, P(2,x) = 9 + 44*x + 44*x^2, P(3,x) = 13 + 105*x + 246*x^2 + 170*x^3.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + 9*x;
P[2, x_] := 9 + 44*x + 44*x^2;
P[3, x_] := 13 + 105*x + 246*x^2 + 170*x^3;
P[n_, x_] := P[n, x] = Expand[Together[(-(1 + 12*x + 62*x^2 + 180*x^3 + 321*x^4 + 360*x^5 + 248*x^6 + 96*x^7 + 16*x^8)*P[n - 4, x] + (4 + 40*x + 168*x^2 + 384*x^3 + 516*x^4 + 408*x^5 + 176*x^6 + 32*x^7)*P[n - 3, x] - (6 + 48*x + 156*x^2 + 264*x^3 + 246*x^4 + 120*x^5 + 24*x^6)*P[n - 2, x] + (4 + 24*x + 56*x^2 + 64*x^3 + 36*x^4 + 8*x^5)*P[n - 1, x])/(1 + 4*x + 6*x^2 + 4*x^3 + x^4)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 5 + 9*x; v[3] = 9 + 44*x + 44*x^2; v[4] = 13 + 105*x + 246*x^2 + 170*x^3; for(n = 4, N, my(i = n + 1); v[i] = (-(1 + 12*x + 62*x^2 + 180*x^3 + 321*x^4 + 360*x^5 + 248*x^6 + 96*x^7 + 16*x^8)*v[i - 4] + (4 + 40*x + 168*x^2 + 384*x^3 + 516*x^4 + 408*x^5 + 176*x^6 + 32*x^7)*v[i - 3] - (6 + 48*x + 156*x^2 + 264*x^3 + 246*x^4 + 120*x^5 + 24*x^6)*v[i - 2] + (4 + 24*x + 56*x^2 + 64*x^3 + 36*x^4 + 8*x^5)*v[i - 1])/(1 + 4*x + 6*x^2 + 4*x^3 + x^4)); 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
one_plus_derivative of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
-
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
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
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
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
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
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
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
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
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
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
-
from
one_plus_derivative of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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.