A018838 - OEIS

This site is supported by donations to The OEIS Foundation.

A018838

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

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; refs; listen; history; internal format)

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:47 EST 2012. Contains 205860 sequences.