A059364 → basis A007318 → 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 + 5\,n x + 3\,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 | 4 | 7 | |||||||||||||
| 2 | 15 | 41 | 28 | 84 | ||||||||||||
| 3 | 105 | 437 | 606 | 280 | 1428 | |||||||||||
| 4 | 945 | 5298 | 11135 | 10398 | 3640 | 31416 | ||||||||||
| 5 | 10395 | 73398 | 207253 | 292538 | 206408 | 58240 | 848232 | |||||||||
| 6 | 135135 | 1151679 | 4088851 | 7740801 | 8241526 | 4678872 | 1106560 | 27143424 | ||||||||
| 7 | 2027025 | 20248155 | 86669703 | 206066737 | 293920512 | 251496652 | 119533584 | 24344320 | 1004306688 | |||||||
| 8 | 34459425 | 394894260 | 1979588826 | 5669877104 | 10148317129 | 11623455884 | 8319487228 | 3402193040 | 608608000 | 42180880896 | ||||||
| 9 | 654729075 | 8467854840 | 48669226974 | 163156152104 | 351574584363 | 504998541408 | 483527022084 | 297587310144 | 106824957120 | 17041024000 | 1982501402112 | |||||
| 10 | 13749310575 | 198121552965 | 1284557266494 | 4935025230378 | 12440906986847 | 21503781484821 | 25809022247412 | 21238671197628 | 11468530713984 | 3669435174720 | 528271744000 | 103090072909824 | ||||
| 11 | 316234143225 | 5024272277745 | 36280949930172 | 157180527359490 | 453931718530333 | 917577811703681 | 1324736082174390 | 1365996193957452 | 985891027140984 | 474327053294016 | 136911046052480 | 17961239296000 | 5876134155859968 | |||
| 12 | 7905853580625 | 137307470242950 | 1092921822530865 | 5271908331403614 | 17163972475559455 | 39734918878214346 | 67068781087395947 | 83165139889388730 | 75189134854950324 | 48336144336566808 | 20972877123190592 | 5514739686341760 | 664565853952000 | 364320317663318016 | ||
| 13 | 213458046676875 | 4023535839784650 | 35001188018051355 | 186058397849132178 | 674303590096249845 | 1759401708734165542 | 3400253844488264409 | 4928210020509333590 | 5356712236659207948 | 4312641291285316776 | 2499713455788818304 | 987813056458851200 | 238532865510374400 | 26582634158080000 | 24409461283442307072 | |
| 14 | 6190283353629375 | 125861235360860475 | 1188046493634229245 | 6900744622401041427 | 27555315220303929159 | 80017703927429544053 | 174261634965728786167 | 289129005907766043697 | 367257685745018374862 | 355405223623620128268 | 257935265743144352184 | 136134257236225871872 | 49393414527531459200 | 11027809607530419200 | 1143053268797440000 | 1757481212407846109184 |
Compute more
?
Technical details
- Node id
n-fc85eff121403457· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-5ef78deb29f8c984
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: 15, 41, 28; 3: 105, 437, 606, 280; 4: 945, 5298, 11135, 10398, 3640; 5: 10395, 73398, 207253, 292538, 206408, 58240; 6: 135135, 1151679, 4088851, 7740801, 8241526, 4678872, 1106560; 7: 2027025, 20248155, 86669703, 206066737, 293920512, 251496652, 119533584, 24344320; 8: 34459425, 394894260, 1979588826, 5669877104, 10148317129, 11623455884, 8319487228, 3402193040, 608608000; 9: 654729075, 8467854840, 48669226974, 163156152104, 351574584363, 504998541408, 483527022084, 297587310144, 106824957120, 17041024000;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = (2*n+1+(5*n+2)*x+(3*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 + (5*n + 2)*x + (3*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 + (5*n + 2)*x + (3*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_A007318 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.?
-
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.?
- ↑ 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_A007318 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.