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 A004664 #29 Feb 09 2023 12:42:44
%S A004664 1,2,6,15,40,145,756,5089,40384,362961,3628900,39916921,479001744,
%T A004664 6227020969,87178291396,1307674368225,20922789888256,355687428096289,
%U A004664 6402373705728324,121645100408832361,2432902008176640400,51090942171709440441,1124000727777607680484
%N A004664 a(n) = n! + n^2.
%C A004664 It appears that n! + n^2 is not a perfect square for n >= 1. - _Alexander R. Povolotsky_, Sep 26 2008
%H A004664 Vincenzo Librandi, <a href="/A004664/b004664.txt">Table of n, a(n) for n = 0..200</a>
%H A004664 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F A004664 Possible recurrence relation (according to WolframAlpha): a(n+2) = ((n+2)*(n^3+n^2-n-2)*a(n+1))/(n^3-2*n-1)-((n+2)*(n^2+n-1)*a(n))/(n^2-n-1). - _Alexander R. Povolotsky_, Nov 06 2010
%t A004664 Table[n! + n^2, {n, 0, 20}] (* _Stefan Steinerberger_, Apr 11 2006 *)
%o A004664 (Magma) [Factorial(n) + n^2: n in [0..25]]; // _Vincenzo Librandi_, Jul 26 2013
%K A004664 nonn
%O A004664 0,2
%A A004664 _N. J. A. Sloane_
%E A004664 One more term from _Stefan Steinerberger_, Apr 11 2006