A132812 → basis A007318 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,n + 4\,n x + 2\,n x^{2} + n^{2} + 2\,n^{2} x + n^{2} x^{2}\right)\,P_{n}(x) = \left(2 + 4\,x - 2\,x^{2} - 8\,x^{3} - 4\,x^{4} + 6\,n + 21\,n x + 24\,n x^{2} + 9\,n x^{3} + 4\,n^{2} + 17\,n^{2} x + 26\,n^{2} x^{2} + 17\,n^{2} x^{3} + 4\,n^{2} x^{4}\right)\,P_{n-1}(x) + \left(-2\,x - 10\,x^{2} - 18\,x^{3} - 14\,x^{4} - 4\,x^{5} - 2\,n x - 10\,n x^{2} - 18\,n x^{3} - 14\,n x^{4} - 4\,n x^{5}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 6 | 10 | |||||||||||||
| 2 | 15 | 45 | 33 | 93 | ||||||||||||
| 3 | 56 | 252 | 372 | 180 | 860 | |||||||||||
| 4 | 210 | 1260 | 2800 | 2730 | 985 | 7985 | ||||||||||
| 5 | 792 | 5940 | 17640 | 25920 | 18840 | 5418 | 74550 | |||||||||
| 6 | 3003 | 27027 | 100485 | 197505 | 216405 | 125307 | 29953 | 699685 | ||||||||
| 7 | 11440 | 120120 | 536536 | 1321320 | 1937320 | 1690920 | 813400 | 166344 | 6597400 | |||||||
| 8 | 43758 | 525096 | 2738736 | 8108100 | 14900886 | 17405388 | 12618144 | 5190372 | 927441 | 62457921 | ||||||
| 9 | 167960 | 2267460 | 13525200 | 46781280 | 103390560 | 151400340 | 146884920 | 91035360 | 32704380 | 5188590 | 593346050 | |||||
| 10 | 646646 | 9699690 | 65126490 | 257734620 | 665705040 | 1172539368 | 1426184760 | 1182791610 | 640074435 | 204086025 | 29113953 | 5653702637 | ||||
| 11 | 2496144 | 41186376 | 307405560 | 1369894680 | 4049567280 | 8337555072 | 12199084128 | 12683895840 | 9183802320 | 4409933220 | 1263896172 | 163786428 | 54012503220 | |||
| 12 | 9657700 | 173838600 | 1427794368 | 7075231020 | 23557775670 | 55521025560 | 94968279120 | 118784066544 | 107820149580 | 69262787880 | 29889082080 | 7779300750 | 923511849 | 517192500721 | ||
| 13 | 37442160 | 730122120 | 6544057520 | 35694859200 | 132189961904 | 350969703084 | 687281234640 | 1005012040032 | 1097399647344 | 883703837016 | 510095874288 | 199860321024 | 47640373872 | 5217709266 | 4962377183470 | |
| 14 | 145422675 | 3053876175 | 29661211125 | 176598287775 | 720032237925 | 2126632783275 | 4691977695405 | 7855370851185 | 10028281548285 | 9714215285775 | 7028458421985 | 3683073257955 | 1321375611465 | 290519829495 | 29532022785 | 47698928343285 |
Compute more
?
Technical details
- Node id
n-2bcf501d4853538e· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-ca6d936c14642db2
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: 4, 6; 2: 15, 45, 33; 3: 56, 252, 372, 180; 4: 210, 1260, 2800, 2730, 985; 5: 792, 5940, 17640, 25920, 18840, 5418; 6: 3003, 27027, 100485, 197505, 216405, 125307, 29953; 7: 11440, 120120, 536536, 1321320, 1937320, 1690920, 813400, 166344; 8: 43758, 525096, 2738736, 8108100, 14900886, 17405388, 12618144, 5190372, 927441; 9: 167960, 2267460, 13525200, 46781280, 103390560, 151400340, 146884920, 91035360, 32704380, 5188590;
%F FormulaThe row polynomials satisfy (n^2+2*n+(2*n^2+4*n)*x+(n^2+2*n)*x^2)*P(n,x) = (4*n^2+6*n+2+(17*n^2+21*n+4)*x+(26*n^2+24*n-2)*x^2+(17*n^2+9*n-8)*x^3+(4*n^2-4)*x^4)*P(n-1,x) - ((2*n+2)*x+(10*n+10)*x^2+(18*n+18)*x^3+(14*n+14)*x^4+(4*n+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[((4*n^2 + 6*n + 2 + (17*n^2 + 21*n + 4)*x + (26*n^2 + 24*n - 2)*x^2 + (17*n^2 + 9*n - 8)*x^3 + (4*n^2 - 4)*x^4)*P[n - 1, x] - ((2*n + 2)*x + (10*n + 10)*x^2 + (18*n + 18)*x^3 + (14*n + 14)*x^4 + (4*n + 4)*x^5)*D[P[n - 1, x], x])/(n^2 + 2*n + (2*n^2 + 4*n)*x + (n^2 + 2*n)*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] = ((4*n^2 + 6*n + 2 + (17*n^2 + 21*n + 4)*x + (26*n^2 + 24*n - 2)*x^2 + (17*n^2 + 9*n - 8)*x^3 + (4*n^2 - 4)*x^4)*v[i - 1] - ((2*n + 2)*x + (10*n + 10)*x^2 + (18*n + 18)*x^3 + (14*n + 14)*x^4 + (4*n + 4)*x^5)*deriv(v[i - 1], x))/(n^2 + 2*n + (2*n^2 + 4*n)*x + (n^2 + 2*n)*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
shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
narayana?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
narayana?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s 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, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
-
from
basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
-
from
shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
Related ?
Same fingerprint ?
- A126216 → x ↦ x/(x+1)
- A063007 → x ↦ x+1 → D
- A033282 → x ↦ x+1 → reverse
- A033282 → x ↦ x+1
- narayana → basis A007318 → x ↦ x/(x+1)
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023