id:A087057 - OEIS Search Results

Search: id:A087057

Displaying 1-1 of 1 results found.

page 1

Smallest number whose square is larger than 2*n^2.

+0
6

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, 37, 39, 40, 42, 43, 44, 46, 47, 49, 50, 51, 53, 54, 56, 57, 58, 60, 61, 63, 64, 66, 67, 68, 70, 71, 73, 74, 75, 77, 78, 80, 81, 83, 84, 85, 87, 88, 90, 91, 92, 94, 95, 97, 98, 99, 101 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Integer solutions to the equation x=ceiling(r*floor(x/r)) where r=sqrt(2) - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 14 2004`
	FORMULA	`A087057(n) = 1 + A001951(n) = 1 + floor[n*sqrt(2)] = sqrt(A087058(n))`
	EXAMPLE	`A087057(10) = 15 because the 15^2 = 225 is the smallest square number greater than 2*10^2 = 200.`
	CROSSREFS	`Cf. A001951, A087055, A087056, A087058, A087059, A087060.` `Sequence in context: A039033 A047333 A032796 this_sequence A167389 A087067 A166018` `Adjacent sequences: A087054 A087055 A087056 this_sequence A087058 A087059 A087060`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jens Voss (jens(AT)voss-ahrensburg.de), Aug 07 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research