id:A018841 - OEIS Search Results

Search: id:A018841

Displaying 1-1 of 1 results found.

page 1

Number of steps for {2,3} fairy knight to reach (n,n) on infinite chess-board.

+0
1

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

	OFFSET	`0,2`
	FORMULA	`For n >= 14, a(n) = a(n-5) + 2 (David W. Wilson).`
	CROSSREFS	`Sequence in context: A057063 A002849 A072984 this_sequence A138125 A098793 A083220` `Adjacent sequences: A018838 A018839 A018840 this_sequence A018842 A018843 A018844`
	KEYWORD	`nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com)`

page 1

Search completed in 0.002 seconds

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research