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 A087057 #23 Nov 23 2018 02:17:34 %S A087057 2,3,5,6,8,9,10,12,13,15,16,17,19,20,22,23,25,26,27,29,30,32,33,34,36, %T A087057 37,39,40,42,43,44,46,47,49,50,51,53,54,56,57,58,60,61,63,64,66,67,68, %U A087057 70,71,73,74,75,77,78,80,81,83,84,85,87,88,90,91,92,94,95,97,98,99,101 %N A087057 Smallest number whose square is larger than 2*n^2. %C A087057 Integer solutions to the equation x=ceiling(r*floor(x/r)) where r=sqrt(2). - _Benoit Cloitre_, Feb 14 2004 %H A087057 Reinhard Zumkeller, <a href="/A087057/b087057.txt">Table of n, a(n) for n = 1..10000</a> %F A087057 a(n) = 1 + A001951(n) = 1 + floor(n*sqrt(2)) = sqrt(A087058(n)). %F A087057 a(n) = ceiling(n*sqrt(2)). - _Vincenzo Librandi_, Oct 22 2011 %e A087057 a(10) = 15 because the 15^2 = 225 is the smallest square number greater than 2*10^2 = 200. %e A087057 Can be built by recursive removals: %e A087057 start with 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, ... %e A087057 get a(1) := 2 and remove the 2nd term (= 4): %e A087057 [2] _ 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, ... %e A087057 get a(2) := 3 and remove the 3rd term (= 7): %e A087057 [2, 3] _ 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, ... %e A087057 get a(3) := 5 and remove the 5th term (= 11): %e A087057 [2, 3, 5] _ 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, ... %e A087057 get a(4) := 6 and remove the 6th term (= 14): %e A087057 [2, 3, 5, 6] _ 8, 9, 10, 12, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, ... %e A087057 get a(5) := 8 and remove the 8th term (= 18): %e A087057 [2, 3, 5, 6, 8] _ 9, 10, 12, 13, 15, 16, 17, 19, 20, 21, 22, 23, 24, ... %e A087057 get a(6) = 9 and remove the 9th term (= 21), etc. %e A087057 - _Reinhard Zumkeller_, Feb 04 2014 %t A087057 Ceiling[Range[110]Sqrt[2]] (* _Harvey P. Dale_, Oct 30 2013 *) %o A087057 (PARI) a(n)=ceil(n*sqrt(2)) \\ _Charles R Greathouse IV_, Oct 24 2011 %o A087057 (PARI) a(n)=sqrtint(2*n^2+sqrtint(8*n^2)+1) \\ _Charles R Greathouse IV_, Oct 24 2011 %o A087057 (Haskell) %o A087057 a087057 n = a087057_list !! (n-1) %o A087057 a087057_list = f [2..] where %o A087057 f (x:xs) = x : f (us ++ vs) where (us, _ : vs) = splitAt (x - 1) xs %o A087057 -- _Reinhard Zumkeller_, Feb 04 2014 %Y A087057 Cf. A001951, A087055, A087056, A087058, A087059, A087060. %K A087057 easy,nonn %O A087057 1,1 %A A087057 _Jens Voß_, Aug 07 2003