A116666 → reverse → x ↦ x/(x+1)
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 - 2\,x - x^{2} + 2\,n + 4\,n x + 2\,n x^{2}\right)\,P_{n}(x) = \left(1 - 2\,x - 11\,x^{2} - 12\,x^{3} - 4\,x^{4} + 2\,n + 12\,n x + 22\,n x^{2} + 16\,n x^{3} + 4\,n x^{4}\right)\,P_{n-1}(x) + \left(-2\,x - 10\,x^{2} - 18\,x^{3} - 14\,x^{4} - 4\,x^{5}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 4 | 7 | ||||||
| 2 | 5 | 16 | 12 | 33 | |||||
| 3 | 7 | 36 | 60 | 32 | 135 | ||||
| 4 | 9 | 64 | 168 | 192 | 80 | 513 | |||
| 5 | 11 | 100 | 360 | 640 | 560 | 192 | 1863 | ||
| 6 | 13 | 144 | 660 | 1600 | 2160 | 1536 | 448 | 6561 | |
| 7 | 15 | 196 | 1092 | 3360 | 6160 | 6720 | 4032 | 1024 | 22599 |
Compute more
?
Technical details
- Node id
n-69d4ac389ef33ff0· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-238832ed0536debf
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 4; 2: 5, 16, 12; 3: 7, 36, 60, 32; 4: 9, 64, 168, 192, 80; 5: 11, 100, 360, 640, 560, 192; 6: 13, 144, 660, 1600, 2160, 1536, 448; 7: 15, 196, 1092, 3360, 6160, 6720, 4032, 1024; 8: 17, 256, 1680, 6272, 14560, 21504, 19712, 10240, 2304; 9: 19, 324, 2448, 10752, 30240, 56448, 69888, 55296, 25344, 5120;
%F FormulaThe row polynomials satisfy (2*n-1+(4*n-2)*x+(2*n-1)*x^2)*P(n,x) = (2*n+1+(12*n-2)*x+(22*n-11)*x^2+(16*n-12)*x^3+(4*n-4)*x^4)*P(n-1,x) - (2*x+10*x^2+18*x^3+14*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[((2*n + 1 + (12*n - 2)*x + (22*n - 11)*x^2 + (16*n - 12)*x^3 + (4*n - 4)*x^4)*P[n - 1, x] - (2*x + 10*x^2 + 18*x^3 + 14*x^4 + 4*x^5)*D[P[n - 1, x], x])/(2*n - 1 + (4*n - 2)*x + (2*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; for(n = 1, N, my(i = n + 1); v[i] = ((2*n + 1 + (12*n - 2)*x + (22*n - 11)*x^2 + (16*n - 12)*x^3 + (4*n - 4)*x^4)*v[i - 1] - (2*x + 10*x^2 + 18*x^3 + 14*x^4 + 4*x^5)*deriv(v[i - 1], x))/(2*n - 1 + (4*n - 2)*x + (2*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
reversal of Triangle, row sums = number of edges in n-dimensional hypercubes.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle, row sums = number of edges in n-dimensional hypercubes.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of Triangle read by rows, (n-1) zeros followed by (2n, 1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, (n-1) zeros followed by (2n, 1).?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
-
from
Triangle read by rows, (n-1) zeros followed by (2n, 1).?
-
-
from
shift_x_plus_one of Triangle read by rows, (n-1) zeros followed by (2n, 1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle, row sums = number of edges in n-dimensional hypercubes.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle, row sums = number of edges in n-dimensional hypercubes.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
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)
-
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?
-
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, row sums = number of edges in n-dimensional hypercubes.?
-
-
from
reversal of Triangle, row sums = number of edges in n-dimensional hypercubes.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
-
from
Triangle, row sums = number of edges in n-dimensional hypercubes.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle, row sums = number of edges in n-dimensional hypercubes.?
Related ?
Candidate equalities ?
- A134082 → basis A007318 → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
Same fingerprint ?
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.