A059364 → basis A013610 → 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 + x\right)\,P_{n}(x) = \left(1 + 2\,x + x^{2} + 2\,n + 7\,n x + 5\,n x^{2}\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 | 3 | 6 | 9 | |||||||||||||
| 2 | 15 | 63 | 66 | 144 | ||||||||||||
| 3 | 105 | 681 | 1470 | 1056 | 3312 | |||||||||||
| 4 | 945 | 8334 | 27531 | 40374 | 22176 | 99360 | ||||||||||
| 5 | 10395 | 116244 | 519525 | 1159920 | 1293660 | 576576 | 3676320 | |||||||||
| 6 | 135135 | 1833417 | 10357389 | 31184235 | 52775100 | 47598948 | 17873856 | 161758080 | ||||||||
| 7 | 2027025 | 32366115 | 221363847 | 840629529 | 1914258960 | 2613887820 | 1981669968 | 643458816 | 8249662080 | |||||||
| 8 | 34459425 | 633331980 | 5090196114 | 23366619720 | 67008213009 | 122920710300 | 140857790076 | 92187268560 | 26381811456 | 478480400640 | ||||||
| 9 | 654729075 | 13618441170 | 125846997246 | 678114795924 | 2348020554291 | 5417871294114 | 8330650685244 | 8231016446136 | 4741868771424 | 1213563326976 | 31101226041600 | |||||
| 10 | 13749310575 | 319378447395 | 3337327441836 | 20658607573950 | 83892286232235 | 233524345445235 | 451255100389938 | 597714530316300 | 519361082952840 | 267320137209120 | 61891729675776 | 2239288274995200 | ||||
| 11 | 316234143225 | 8115665682285 | 94643724216348 | 662038310943666 | 3086404607482605 | 10069027974245565 | 23456230653901734 | 39017719819111428 | 45417318605628120 | 35232583801168800 | 16393437466253568 | 3465936861843456 | 176903773724620800 | |||
| 12 | 7905853580625 | 222181924793850 | 2861148712028085 | 22324224950788878 | 117544452154628751 | 439996380412578030 | 1200616472776522815 | 2406273065365791474 | 3515513874106500108 | 3651271029972535320 | 2559023548527636000 | 1086648106987554048 | 211422148572450816 | 15213724540317388800 | ||
| 13 | 213458046676875 | 6520698305755200 | 91915022261152395 | 791589888665153316 | 4647099054927042225 | 19637836113345104376 | 61456405872196265985 | 144210059968126875588 | 253732896915017740200 | 330608233500287460768 | 310077523788433503120 | 198235053091487935296 | 77427173072634739200 | 13953861805781753856 | 1414876382249517158400 | |
| 14 | 6190283353629375 | 204255772180958925 | 3128505225282038655 | 29482073351831266209 | 190968754688110109961 | 899441280186828024879 | 3176522134341194124261 | 8545496556001614276987 | 17597168268272522632548 | 27602674452474595916472 | 32465432768384981305008 | 27764320728631928845104 | 16320076788602050842816 | 5901991280524737345024 | 990724188210504523776 | 141487638224951715840000 |
Compute more
?
Technical details
- Node id
n-28cc1c51f0f8e06b· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-e0f3e80aae5e0ae7
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, 6; 2: 15, 63, 66; 3: 105, 681, 1470, 1056; 4: 945, 8334, 27531, 40374, 22176; 5: 10395, 116244, 519525, 1159920, 1293660, 576576; 6: 135135, 1833417, 10357389, 31184235, 52775100, 47598948, 17873856; 7: 2027025, 32366115, 221363847, 840629529, 1914258960, 2613887820, 1981669968, 643458816; 8: 34459425, 633331980, 5090196114, 23366619720, 67008213009, 122920710300, 140857790076, 92187268560, 26381811456; 9: 654729075, 13618441170, 125846997246, 678114795924, 2348020554291, 5417871294114, 8330650685244, 8231016446136, 4741868771424, 1213563326976;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = (2*n+1+(7*n+2)*x+(5*n+1)*x^2)*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 + (7*n + 2)*x + (5*n + 1)*x^2)*P[n - 1, x])/(1 + x)]];
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 + (7*n + 2)*x + (5*n + 1)*x^2)*v[i - 1])/(1 + x)); 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
basis_map_A013610 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
-
from
basis_map_A013610 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.