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 A110313 #27 Aug 09 2023 14:03:50
%S A110313 1,2,7,34,221,1786,17347,196442,2542969,37030546,599172671,
%T A110313 10664259442,207061905877,4355429249354,98661276360571,
%U A110313 2394559287772906,61991654930903537,1705178260099590562,49662655090649112439,1526761411676393108546,49407037167974524897741
%N A110313 Expansion of e.g.f. exp(x)/(1-x-x^2).
%C A110313 Binomial transform of A005442.
%C A110313 Rows sums of A039948.
%H A110313 Vincenzo Librandi, <a href="/A110313/b110313.txt">Table of n, a(n) for n = 0..200</a>
%F A110313 E.g.f.: exp(x)/(1-x-x^2).
%F A110313 a(n) = Sum_{k=0..n} binomial(n,k)*k!*Fibonacci(k+1).
%F A110313 a(n) = Sum_{k=0..n} n!*Fibonacci(n-k+1)/k!.
%F A110313 Recurrence: a(n+3) = (n+4)*a(n+2) + (n+2)^2*a(n+1) - (n+2)*(n+1)*a(n). - _Emanuele Munarini_, May 27 2011
%F A110313 a(n) ~ n!*exp((sqrt(5)-1)/2)*((1+sqrt(5))/2)^(n+1)/sqrt(5). - _Vaclav Kotesovec_, Oct 18 2012
%t A110313 Table[Sum[Binomial[n, k]k!Fibonacci[k+1], {k,0,n}], {n,0,30}] (* _Emanuele Munarini_, May 27 2011 *)
%t A110313 With[{nn=20},CoefficientList[Series[Exp[x]/(1-x-x^2),{x,0,nn}],x] Range[0,nn]!] (* _Harvey P. Dale_, Aug 09 2023 *)
%o A110313 (Maxima) makelist(sum(binomial(n,k)*k!*fib(k+1), k,0,n), n,0,30); /* _Emanuele Munarini_, May 27 2011 */
%o A110313 (Magma) [(&+[Binomial(n,k)*Factorial(k)*Fibonacci(k+1): k in [0..n]]): n in [0..30]]; // _G. C. Greubel_, Nov 30 2021
%o A110313 (Sage) [sum(factorial(n)*fibonacci(n-k+1)/factorial(k) for k in (0..n)) for n in (0..30)] # _G. C. Greubel_, Nov 30 2021
%Y A110313 Cf. A000045, A005442, A039948 (row sums).
%K A110313 easy,nonn
%O A110313 0,2
%A A110313 _Paul Barry_, Jul 19 2005