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 A007682 M5044 #18 Jan 10 2018 03:11:52
%S A007682 1,-1,1,1,-1,-17,-107,-415,1231,56671,924365,11322001,97495687,
%T A007682 -78466897,-31987213451,-1073614991039,-26754505127713,
%U A007682 -558657850929473,-9259584394031075,-70982644052430799,3334438016903221111,240585292388924690959,10679411902033402697861
%N A007682 a(n) = -Sum_{k = 0..n-1} (n+k)!a(k)/(2k)!.
%D A007682 H. W. Gould, A class of binomial sums and a series transform, Utilitas Math., 45 (1994), 71-83.
%D A007682 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007682 H. W. Gould, <a href="/A007680/a007680.pdf">A class of binomial sums and a series transform</a>, Utilitas Math., 45 (1994), 71-83. (Annotated scanned copy)
%p A007682 A007682 := proc(n) option remember; if n=0 then RETURN(1) fi; if n>0 then RETURN((-1)*add((n+k)!*'A007682(k)'/(2*k)!, k=0..n-1 )) fi; end;
%t A007682 a[n_] := a[n] = -Sum[(n+k)!*a[k]/(2*k)!, {k, 0, n-1}]; a[0] = 1; Table[a[n], {n, 0, 22}] (* _Jean-François Alcover_, Jan 27 2014 *)
%K A007682 sign,easy,nice
%O A007682 0,6
%A A007682 _N. J. A. Sloane_