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 A006701 #18 Jul 08 2025 00:47:47
%S A006701 0,1,1,5,13,60,246,1266,6679,39568,247940,1677435,12020295,91463410,
%T A006701 733490265,6189608760,54746987035,506444804075,4887127598817,
%U A006701 49096724251235,512474550910080,5548429401985372,62208756548406172,721256031012180537,8635815672831322186
%N A006701 Exponentiation of g.f. for Fibonacci numbers.
%H A006701 Vaclav Kotesovec, <a href="/A006701/b006701.txt">Table of n, a(n) for n = 0..500</a>
%F A006701 a(-1) = 1, a(n) = Sum_{k=0..n} binomial(n, k) * A000045(k) * a(n-k-1). - _Sean A. Irvine_, Jun 11 2017
%t A006701 a[-1] = 1; a[n_] := a[n] = Sum[Binomial[n, k]*Fibonacci[k]*a[n - k - 1], {k, 0, n}]; Table[a[n], {n, 0, 30}] (* _Vaclav Kotesovec_, Jun 08 2021 *)
%o A006701 (PARI) a(n) = if (n==-1, 1, sum(k=0, n, binomial(n,k)*fibonacci(k)*a(n-k-1))); \\ _Michel Marcus_, Jun 11 2017
%Y A006701 Cf. A000045, A007552, A256180.
%K A006701 nonn
%O A006701 0,4
%A A006701 _N. J. A. Sloane_