The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A087058 Smallest square number greater than 2*n^2. 6
 4, 9, 25, 36, 64, 81, 100, 144, 169, 225, 256, 289, 361, 400, 484, 529, 625, 676, 729, 841, 900, 1024, 1089, 1156, 1296, 1369, 1521, 1600, 1764, 1849, 1936, 2116, 2209, 2401, 2500, 2601, 2809, 2916, 3136, 3249, 3364, 3600, 3721, 3969, 4096, 4356, 4489 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA A087058(n) = A087057(n)^2 = (1 + A001951(n))^2 = (1 + floor[n*sqrt(2)])^2 EXAMPLE A087058(10) = 225 because 225 is the smallest square number greater than 2*10^2 = 200. MATHEMATICA Table[Ceiling[Sqrt[2n^2]]^2, {n, 50}] (* Harvey P. Dale, Jan 22 2015 *) CROSSREFS Cf. A001951, A087055, A087056, A087057, A087059, A087060. Sequence in context: A062503 A248648 A063577 * A046659 A063760 A238334 Adjacent sequences:  A087055 A087056 A087057 * A087059 A087060 A087061 KEYWORD easy,nonn AUTHOR Jens Voß, Aug 07 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 29 17:41 EDT 2021. Contains 346346 sequences. (Running on oeis4.)