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 A181908 #11 Apr 04 2012 12:13:37
%S A181908 17,145,1095,8098,59868,442406,3269011
%N A181908 Least k such that log(ceiling(sqrt(k!))^2-k!)/k > n.
%C A181908 This sequence show how quickly A068869 increase in a logarithmic scale.
%e A181908 a(1)=17 because log(ceiling(sqrt(17!))^2-17!)/17 = 1.00471 > 1.
%t A181908 kkk = 0; n = 1; Do[While[kkk < max, n++; kk = Floor[Sqrt[n!]]; kkk = N[Log[(kk + 1)^2 - n!]/n]]; Print[n], {max, 1, 5}]
%o A181908 (PARI) a(n)=my(k=solve(x=1,4<<(3*n),(log(2)+lngamma(x+1)/2)/x-n)\1,f=k!);while(n>log((sqrtint(f*=k++)+1)^2-f)/k,);k \\ _Charles R Greathouse IV_, Apr 03 2012
%Y A181908 Cf. A068869.
%K A181908 nonn,hard,more
%O A181908 1,1
%A A181908 _Artur Jasinski_, Apr 01 2012
%E A181908 a(6)-a(7) from _Charles R Greathouse IV_, Apr 03 2012