A352880 → reverse → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(3 + 6\,x + 3\,x^{2} + 7\,n + 14\,n x + 7\,n x^{2} + 5\,n^{2} + 10\,n^{2} x + 5\,n^{2} x^{2} + n^{3} + 2\,n^{3} x + n^{3} x^{2}\right)\,P_{n}(x) = \left(12 + 42\,x + 48\,x^{2} + 18\,x^{3} + 16\,n + 59\,n x + 70\,n x^{2} + 27\,n x^{3} + 7\,n^{2} + 27\,n^{2} x + 33\,n^{2} x^{2} + 13\,n^{2} x^{3} + n^{3} + 4\,n^{3} x + 5\,n^{3} x^{2} + 2\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(6\,x + 18\,x^{2} + 18\,x^{3} + 6\,x^{4} + 7\,n x + 21\,n x^{2} + 21\,n x^{3} + 7\,n x^{4} + 2\,n^{2} x + 6\,n^{2} x^{2} + 6\,n^{2} x^{3} + 2\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 8\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 8 | 8 | ||||||||||||||
| 1 | 18 | 30 | 48 | |||||||||||||
| 2 | 32 | 128 | 112 | 272 | ||||||||||||
| 3 | 50 | 350 | 700 | 420 | 1520 | |||||||||||
| 4 | 72 | 768 | 2592 | 3456 | 1584 | 8472 | ||||||||||
| 5 | 98 | 1470 | 7350 | 16170 | 16170 | 6006 | 47264 | |||||||||
| 6 | 128 | 2560 | 17600 | 56320 | 91520 | 73216 | 22880 | 264224 | ||||||||
| 7 | 162 | 4158 | 37422 | 162162 | 378378 | 486486 | 324324 | 87516 | 1480608 | |||||||
| 8 | 200 | 6400 | 72800 | 407680 | 1274000 | 2329600 | 2475200 | 1414400 | 335920 | 8316200 | ||||||
| 9 | 242 | 9438 | 132132 | 924924 | 3699696 | 8984976 | 13477464 | 12193896 | 6096948 | 1293292 | 46813008 | |||||
| 10 | 288 | 13440 | 226800 | 1935360 | 9596160 | 29611008 | 58605120 | 74419200 | 58605120 | 26046720 | 4992288 | 264051504 | ||||
| 11 | 338 | 18590 | 371800 | 3792360 | 22754160 | 86465808 | 216164520 | 360274200 | 396301620 | 276210220 | 110484088 | 19315400 | 1492153104 | |||
| 12 | 392 | 25088 | 586432 | 7037184 | 50139936 | 229211136 | 701959104 | 1470771456 | 2114233968 | 2050166272 | 1281353920 | 465946880 | 74884320 | 8446316088 | ||
| 13 | 450 | 33150 | 895050 | 12471030 | 103925250 | 561196350 | 2057719950 | 5258617650 | 9465511770 | 11951403750 | 10357883250 | 5867052750 | 1955684250 | 290845350 | 47883240000 | |
| 14 | 512 | 43008 | 1327872 | 21245952 | 204492288 | 1285380096 | 5543201664 | 16893566976 | 36954677760 | 58231613440 | 65510565120 | 51308974080 | 26570718720 | 8175605760 | 1131445440 | 271832858688 |
Compute more
?
Technical details
- Node id
n-3a81c23f7a892ffd· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-5cd009bfc7bc0bb1
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: 8; 1: 18, 30; 2: 32, 128, 112; 3: 50, 350, 700, 420; 4: 72, 768, 2592, 3456, 1584; 5: 98, 1470, 7350, 16170, 16170, 6006; 6: 128, 2560, 17600, 56320, 91520, 73216, 22880; 7: 162, 4158, 37422, 162162, 378378, 486486, 324324, 87516; 8: 200, 6400, 72800, 407680, 1274000, 2329600, 2475200, 1414400, 335920; 9: 242, 9438, 132132, 924924, 3699696, 8984976, 13477464, 12193896, 6096948, 1293292;
%F FormulaThe row polynomials satisfy (n^3+5*n^2+7*n+3+(2*n^3+10*n^2+14*n+6)*x+(n^3+5*n^2+7*n+3)*x^2)*P(n,x) = (n^3+7*n^2+16*n+12+(4*n^3+27*n^2+59*n+42)*x+(5*n^3+33*n^2+70*n+48)*x^2+(2*n^3+13*n^2+27*n+18)*x^3)*P(n-1,x) + ((2*n^2+7*n+6)*x+(6*n^2+21*n+18)*x^2+(6*n^2+21*n+18)*x^3+(2*n^2+7*n+6)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 8.
%t MathematicaP[0, x_] := 8;
P[n_, x_] := P[n, x] = Expand[Together[((n^3 + 7*n^2 + 16*n + 12 + (4*n^3 + 27*n^2 + 59*n + 42)*x + (5*n^3 + 33*n^2 + 70*n + 48)*x^2 + (2*n^3 + 13*n^2 + 27*n + 18)*x^3)*P[n - 1, x] + ((2*n^2 + 7*n + 6)*x + (6*n^2 + 21*n + 18)*x^2 + (6*n^2 + 21*n + 18)*x^3 + (2*n^2 + 7*n + 6)*x^4)*D[P[n - 1, x], x])/(n^3 + 5*n^2 + 7*n + 3 + (2*n^3 + 10*n^2 + 14*n + 6)*x + (n^3 + 5*n^2 + 7*n + 3)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 8; for(n = 1, N, my(i = n + 1); v[i] = ((n^3 + 7*n^2 + 16*n + 12 + (4*n^3 + 27*n^2 + 59*n + 42)*x + (5*n^3 + 33*n^2 + 70*n + 48)*x^2 + (2*n^3 + 13*n^2 + 27*n + 18)*x^3)*v[i - 1] + ((2*n^2 + 7*n + 6)*x + (6*n^2 + 21*n + 18)*x^2 + (6*n^2 + 21*n + 18)*x^3 + (2*n^2 + 7*n + 6)*x^4)*deriv(v[i - 1], x))/(n^3 + 5*n^2 + 7*n + 3 + (2*n^3 + 10*n^2 + 14*n + 6)*x + (n^3 + 5*n^2 + 7*n + 3)*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 read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
Pólya–Schur 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?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
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) = number of vertices of degree k in an origami flip graph OFG(A2n).?
-
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).?
Related ?
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.