id:A018837 - OEIS Search Results

Search: id:A018837

Displaying 1-1 of 1 results found.

page 1

Number of steps for knight to reach (n,0) on infinite chess-board.

+0
1

0, 3, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 8, 9, 10, 11, 10, 11, 12, 13, 12, 13, 14, 15, 14, 15, 16, 17, 16, 17, 18, 19, 18, 19, 20, 21, 20, 21, 22, 23, 22, 23, 24, 25, 24, 25, 26, 27, 26, 27 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`2[ (n+2)/4 ] if n even, 2[ (n+1)/4 ]+1 if n odd (n >= 8).`
	CROSSREFS	`Sequence in context: A095206 A049071 A029211 this_sequence A097618 A039639 A023509` `Adjacent sequences: A018834 A018835 A018836 this_sequence A018838 A018839 A018840`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Marc LeBrun (mlb(AT)well.com)`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research