id:A018838 - OEIS Search Results

Search: id:A018838

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 2, 4, 2, 4, 4, 4, 6, 6, 6, 8, 8, 8, 10, 10, 10, 12, 12, 12, 14, 14, 14, 16, 16, 16, 18, 18, 18, 20, 20, 20, 22, 22, 22, 24, 24, 24, 26, 26, 26, 28, 28, 28, 30, 30, 30, 32, 32, 32, 34, 34, 34, 36, 36, 36, 38, 38, 38, 40, 40, 40, 42, 42, 42, 44, 44, 44 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`2*ceil(n/3), n >= 3.`
	CROSSREFS	`Adjacent sequences: A018835 A018836 A018837 this_sequence A018839 A018840 A018841` `Sequence in context: A004020 A069465 A047947 this_sequence A116982 A128859 A047975`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`njas, Marc LeBrun (mlb(AT)well.com)`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research