id:A099188 - OEIS Search Results

Search: id:A099188

Displaying 1-1 of 1 results found.

page 1

2*ceil(n/sqrt(2)).

+0
2

0, 2, 4, 6, 6, 8, 10, 10, 12, 14, 16, 16, 18, 20, 20, 22, 24, 26, 26, 28, 30, 30, 32, 34, 34, 36, 38, 40, 40, 42, 44, 44, 46, 48, 50, 50, 52, 54, 54, 56, 58, 58, 60, 62, 64, 64, 66, 68, 68, 70, 72, 74, 74, 76, 78, 78, 80, 82, 84, 84, 86, 88, 88, 90, 92, 92, 94, 96, 98, 98, 100 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Conjecturally, length of shortest polygonal path from (0,0) to (n,n) with integer vertices and edges. This is true for n <= 10000.`
	CROSSREFS	`a(n) = 2*A049474(n).` `Sequence in context: A020887 A050827 A082990 this_sequence A085271 A003972 A023853` `Adjacent sequences: A099185 A099186 A099187 this_sequence A099189 A099190 A099191`
	KEYWORD	`nonn,easy`
	AUTHOR	`David W. Wilson, Marc 26 2005`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research