OFFSET
0,4
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
FORMULA
Given g.f. A(x) then B(x) = x * A(x) satisfies B(x) = (1 - B(x)) * (x + B(x) * (B(x) - x)). - Michael Somos, Apr 05 2012
Conjecture: 6*n*(n+1)*a(n) -n*(n-14)*a(n-1) +2*n*(14*n-19)*a(n-2) -4*(n-2)*(17*n-48)*a(n-3) +6*(2*n-5)*(n-4)*a(n-4)=0. - R. J. Mathar, Nov 15 2012
Recurrence (of order 3): 3*n*(n+1)*(19*n-27)*a(n) = -2*n*(38*n^2 - 73*n + 9)*a(n-1) - 20*(19*n^3 - 65*n^2 + 66*n - 18)*a(n-2) + 2*(n-3)*(2*n-3)*(19*n-8)*a(n-3). - Vaclav Kotesovec, Jan 22 2014
Lim sup n->infinity |a(n)|^(1/n) = sqrt(20/9 + 1/27*(272376 - 12312 * sqrt(57))^(1/3) + 2/9*(1261 + 57 * sqrt(57))^(1/3)) = 2.637962913244886521522... - Vaclav Kotesovec, Jan 22 2014
EXAMPLE
1 - x + 2*x^3 - 2*x^4 - 5*x^5 + 14*x^6 + 5*x^7 - 72*x^8 + 68*x^9 + ...
MATHEMATICA
CoefficientList[1/x*InverseSeries[Series[x*(1-x+x^2) /(1-x)^2, {x, 0, 20}], x], x] (* Vaclav Kotesovec, Jan 22 2014 *)
PROG
(PARI) {a(n) = if( n<0, 0, polcoeff( serreverse( x * ((1 - x + x^2) / (1 - x)^2 + x * O(x^n))) / x, n))} /* Michael Somos, Apr 05 2012 */
(PARI) {a(n) = local(B); if( n<0, 0, B = O(x); for( k=0, n, B = (1 - B) * (x + B * (B - x))); polcoeff( B / x, n))} /* Michael Somos, Apr 05 2012 */
CROSSREFS
KEYWORD
sign,easy
AUTHOR
Paul Barry, Feb 07 2011
STATUS
approved