OFFSET
1,2
COMMENTS
Conjecture: In general, if k > 0 and g.f. A(x) satisfies A((k+2)*x - (k+1)*A(x)) = x - (k*x)^2, then a(n) ~ (-1)^n * c(k) * (k*(k+1)/log(k+1))^n * n! / n^((k-1)/(k+1) + (k-2)*log(k+1)/k), where c(k) is a constant.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 1..288
FORMULA
a(n) ~ (-1)^n * c * (56/log(8))^n * n! / n^(3/4 + 15*log(2)/7), where c = 0.0288378187676139223379...
PROG
(PARI) {a(n) = my(A=x, V=[1, 7]); for(i=1, n, V = concat(V, 0); A=x*Ser(V); V[#V] = Vec( subst(A, x, 9*x - 8*A) )[#V]/7 ); V[n]}
for(n=1, 30, print1(a(n), ", "))
CROSSREFS
KEYWORD
sign
AUTHOR
Vaclav Kotesovec, Oct 09 2017
STATUS
approved