This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A308940 #7 Jul 02 2019 09:08:39
%S A308940 1,1,3,14,85,645,5878,62495,759351,10379878,157652085,2633903669,
%T A308940 48005235886,947849607015,20154635314591,459170181891230,
%U A308940 11158379672316837,288109467764819749,7876576756719778854,227299554620022188879,6904560742996004248135
%N A308940 Expansion of e.g.f. 1 / (1 - Sum_{k>=1} Fibonacci(k)*x^k/k!).
%F A308940 E.g.f.: sqrt(5)/(sqrt(5) - 2*exp(x/2)*sinh(sqrt(5)*x/2)).
%F A308940 a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * Fibonacci(k) * a(n-k).
%F A308940 a(n) ~ n! * 5^((n+1)/2) * (exp(2*r) - 1) / ((sqrt(5) - 1 + (1 + sqrt(5))*exp(2*r)) * 2^n * r^(n+1)), where r = 0.7361181605960590527095268838693519750655284224... is the root of the equation exp(2*r) = 1 + sqrt(5)*exp(r*(1 - 1/sqrt(5))). - _Vaclav Kotesovec_, Jul 01 2019
%t A308940 nmax = 20; CoefficientList[Series[Sqrt[5]/(Sqrt[5] - 2 Exp[x/2] Sinh[Sqrt[5] x/2]), {x, 0, nmax}], x] Range[0, nmax]!
%t A308940 a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k] Fibonacci[k] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 20}]
%Y A308940 Cf. A000045, A097597, A215928.
%K A308940 nonn
%O A308940 0,3
%A A308940 _Ilya Gutkovskiy_, Jul 01 2019