OFFSET
0,3
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..401
Paul Kinlaw, Michael Morris, and Samanthak Thiagarajan, Sums related to the Fibonacci sequence, Husson University (2021).
FORMULA
a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * A006154(k) * a(n-k).
a(n) ~ n! / (2*sqrt(5) * log((1 + sqrt(5))/2)^(n+1)). - Vaclav Kotesovec, Feb 08 2020
MATHEMATICA
nmax = 19; CoefficientList[Series[(1 - Sinh[x])/(1 - 2 Sinh[x]), {x, 0, nmax}], x] Range[0, nmax]!
PROG
(PARI) seq(n)={Vec(serlaplace((1 - sinh(x + O(x*x^n))) / (1 - 2*sinh(x + O(x*x^n)))))} \\ Andrew Howroyd, Feb 08 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 08 2020
STATUS
approved