A026729 → basis A013611 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4 - 8\,x - 4\,x^{2} + 4\,n + 8\,n x + 4\,n x^{2}\right)\,P_{n}(x) = \left(30 + 164\,x + 328\,x^{2} + 284\,x^{3} + 90\,x^{4} - 13\,n - 68\,n x - 142\,n x^{2} - 132\,n x^{3} - 45\,n x^{4}\right)\,P_{n-1}(x) + \left(5 + 49\,x + 162\,x^{2} + 242\,x^{3} + 169\,x^{4} + 45\,x^{5}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 1 | 5 | 6 | |||||||||||||
| 3 | 2 | 16 | 30 | 48 | ||||||||||||
| 4 | 3 | 37 | 145 | 175 | 360 | |||||||||||
| 5 | 5 | 80 | 466 | 1160 | 1025 | 2736 | ||||||||||
| 6 | 8 | 160 | 1248 | 4720 | 8600 | 6000 | 20736 | |||||||||
| 7 | 13 | 310 | 3019 | 15316 | 42515 | 60950 | 35125 | 157248 | ||||||||
| 8 | 21 | 583 | 6817 | 43419 | 162255 | 354725 | 418875 | 205625 | 1192320 | |||||||
| 9 | 34 | 1076 | 14676 | 112484 | 528856 | 1558620 | 2805900 | 2815500 | 1203750 | 9040896 | ||||||
| 10 | 55 | 1955 | 30476 | 273100 | 1548130 | 5748250 | 13957500 | 21337500 | 18609375 | 7046875 | 68553216 | |||||
| 11 | 89 | 3510 | 61553 | 631400 | 4190770 | 18783076 | 57500650 | 118569000 | 157423125 | 121393750 | 41253125 | 519810048 | ||||
| 12 | 144 | 6240 | 121584 | 1404896 | 10686880 | 56139456 | 207603680 | 539896000 | 966690000 | 1133900000 | 783550000 | 241500000 | 3941498880 | |||
| 13 | 233 | 11004 | 235842 | 3031084 | 25998295 | 156658552 | 679453916 | 2135402680 | 4822510375 | 7626127500 | 8009781250 | 5013737500 | 1413765625 | 29886713856 | ||
| 14 | 377 | 19273 | 450606 | 6375894 | 60877891 | 413935243 | 2060621492 | 7598887620 | 20743608175 | 41372199375 | 58560818750 | 55674943750 | 31849203125 | 8276328125 | 226618269696 | |
| 15 | 610 | 33560 | 850002 | 13130080 | 138121370 | 1046128440 | 5879694410 | 24897414016 | 79770242310 | 192328443400 | 343300913750 | 439682100000 | 381769018750 | 201073625000 | 48450468750 | 1718350184448 |
Compute more
?
Technical details
- Node id
n-b8658464a7171d06· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-ebeb188936acb8ca
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 5; 3: 2, 16, 30; 4: 3, 37, 145, 175; 5: 5, 80, 466, 1160, 1025; 6: 8, 160, 1248, 4720, 8600, 6000; 7: 13, 310, 3019, 15316, 42515, 60950, 35125; 8: 21, 583, 6817, 43419, 162255, 354725, 418875, 205625; 9: 34, 1076, 14676, 112484, 528856, 1558620, 2805900, 2815500, 1203750; 10: 55, 1955, 30476, 273100, 1548130, 5748250, 13957500, 21337500, 18609375, 7046875;
%F FormulaThe row polynomials satisfy (4*n-4+(8*n-8)*x+(4*n-4)*x^2)*P(n,x) = -(13*n-30+(68*n-164)*x+(142*n-328)*x^2+(132*n-284)*x^3+(45*n-90)*x^4)*P(n-1,x) + (5+49*x+162*x^2+242*x^3+169*x^4+45*x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(13*n - 30 + (68*n - 164)*x + (142*n - 328)*x^2 + (132*n - 284)*x^3 + (45*n - 90)*x^4)*P[n - 1, x] + (5 + 49*x + 162*x^2 + 242*x^3 + 169*x^4 + 45*x^5)*D[P[n - 1, x], x])/(4*n - 4 + (8*n - 8)*x + (4*n - 4)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(13*n - 30 + (68*n - 164)*x + (142*n - 328)*x^2 + (132*n - 284)*x^3 + (45*n - 90)*x^4)*v[i - 1] + (5 + 49*x + 162*x^2 + 242*x^3 + 169*x^4 + 45*x^5)*deriv(v[i - 1], x))/(4*n - 4 + (8*n - 8)*x + (4*n - 4)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
References
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741