A059364 → basis A013609 → 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 + 6\,n x + 4\,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 | 5 | 8 | |||||||||||||
| 2 | 15 | 52 | 45 | 112 | ||||||||||||
| 3 | 105 | 559 | 991 | 585 | 2240 | |||||||||||
| 4 | 945 | 6816 | 18422 | 22112 | 9945 | 58240 | ||||||||||
| 5 | 10395 | 94821 | 345778 | 630094 | 573747 | 208845 | 1863680 | |||||||||
| 6 | 135135 | 1492548 | 6865639 | 16835672 | 23211061 | 17058660 | 5221125 | 70819840 | ||||||||
| 7 | 2027025 | 26307135 | 146268477 | 451638611 | 836400403 | 929000669 | 573018015 | 151412625 | 3116072960 | |||||||
| 8 | 34459425 | 514113120 | 3354699564 | 12504716128 | 29122881014 | 43394224672 | 40398328332 | 21483609120 | 4996616625 | 155803648000 | ||||||
| 9 | 654729075 | 11043148005 | 82761477156 | 361713490300 | 1016009236002 | 1902036866286 | 2373154551172 | 1902926721564 | 889829253315 | 184874815125 | 8725004288000 | |||||
| 10 | 13749310575 | 258750000180 | 2190760088481 | 10989203859696 | 36166447058342 | 81599152868088 | 127819757092338 | 137260797750896 | 96706409903739 | 40365370503540 | 7579867420125 | 540950265856000 | ||||
| 11 | 316234143225 | 6569968980015 | 62031232043163 | 351335892754653 | 1326342456028186 | 3504270633591414 | 6611816292187734 | 8908887417425818 | 8400983326576317 | 5280191967249675 | 1990778623322175 | 341094033905625 | 36784618078208000 | |||
| 12 | 7905853580625 | 179744697518400 | 1872709281099810 | 11822927688981312 | 50374020145682647 | 152597546185166464 | 337004668350672636 | 546701183752844416 | 646560066618273007 | 543652982183481408 | 308498871978288450 | 106075503390427200 | 16713607661375625 | 2722061737787392000 | ||
| 13 | 213458046676875 | 5272117072769925 | 60089619558170070 | 418472639500785354 | 1986713711449441005 | 6789956814720674819 | 17186795993281983764 | 32622179383912448940 | 46432284537594125237 | 48946314049722467387 | 37143077599138302774 | 19214478806390822250 | 6073269086549783475 | 885821206052908125 | 217764939022991360000 | |
| 14 | 6190283353629375 | 165058503770909700 | 2043109640334817755 | 15560814860338469256 | 81467638083578554323 | 310151429179517707036 | 885444622244255993839 | 1925690573750534093808 | 3206000476473239221453 | 4066083326084816692732 | 3867089151209191421505 | 2674375308536217103368 | 1271350095474220589025 | 371865152908871993700 | 50491808745015763125 | 18727784755977256960000 |
Compute more
?
Technical details
- Node id
n-e8fd873e4e7b5233· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-23e8f34590336d7d
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, 5; 2: 15, 52, 45; 3: 105, 559, 991, 585; 4: 945, 6816, 18422, 22112, 9945; 5: 10395, 94821, 345778, 630094, 573747, 208845; 6: 135135, 1492548, 6865639, 16835672, 23211061, 17058660, 5221125; 7: 2027025, 26307135, 146268477, 451638611, 836400403, 929000669, 573018015, 151412625; 8: 34459425, 514113120, 3354699564, 12504716128, 29122881014, 43394224672, 40398328332, 21483609120, 4996616625; 9: 654729075, 11043148005, 82761477156, 361713490300, 1016009236002, 1902036866286, 2373154551172, 1902926721564, 889829253315, 184874815125;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = (2*n+1+(6*n+2)*x+(4*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 + (6*n + 2)*x + (4*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 + (6*n + 2)*x + (4*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_A013609 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_A013609 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.