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 A080568 #17 Sep 08 2022 08:45:09
%S A080568 1,2,3,8,27,125,728,5053,40341,362914,3628855,39916889,479001744,
%T A080568 6227021033,87178291577,1307674368610,20922789888987,355687428097597,
%U A080568 6402373705730584,121645100408836181,2432902008176646765,51090942171709450946,1124000727777607697711
%N A080568 Sum of the Fibonacci numbers A000045 and the factorials A000142.
%C A080568 Original puzzle was to find the next four terms after 2, 3, 8, 27, 125. The cubes were intended to mislead - providing one further term would have made the intended sequence too obvious.
%D A080568 Cambridge Archimedeans' Problems Drive, 2001.
%H A080568 Vincenzo Librandi, <a href="/A080568/b080568.txt">Table of n, a(n) for n = 0..100</a>
%F A080568 E.g.f.: (2/sqrt(5))*exp(x/2)*sinh(sqrt(5)*x/2)+1/(1-x). - _Alois P. Heinz_, Jul 05 2015
%p A080568 with(combstruct): with(combinat): a:=proc(m) [ZL, {ZL=Set(Cycle(Z, card>=m))}, labeled]; end: ZLL:=a(1): seq(count(ZLL, size=n)+fibonacci(n), n=0..19); # _Zerinvary Lajos_, Jun 11 2008
%t A080568 Table[n!+Fibonacci[n],{n,0,100}] (* _Vladimir Joseph Stephan Orlovsky_, May 02 2011 *)
%o A080568 (Magma) [Factorial(n)+Fibonacci(n): n in [0..25]]; // _Vincenzo Librandi_, May 03 2011
%o A080568 (PARI) vector(30, n, n--; n! + fibonacci(n)) \\ _Michel Marcus_, Jul 05 2015
%Y A080568 Cf. A000045, A000142.
%K A080568 easy,nonn
%O A080568 0,2
%A A080568 Alasdair Kergon (agk(AT)oxlug.org), Feb 21 2003