id:A018840 - OEIS Search Results

Search: id:A018840

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`0,2`
	FORMULA	`For n >= 18, f(n) = f(n-6)+2 (David W. Wilson).`
	CROSSREFS	`Sequence in context: A071419 A019117 A123587 this_sequence A058209 A160789 A131291` `Adjacent sequences: A018837 A018838 A018839 this_sequence A018841 A018842 A018843`
	KEYWORD	`nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com)`

page 1

Search completed in 0.002 seconds

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.

AT&T Labs Research