login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A018840 Number of steps for {2,3} fairy knight to reach (n,0) on infinite chess-board. 0
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; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

For n >= 18, f(n) = f(n-6)+2 (David W. Wilson).

CROSSREFS

Sequence in context: A019117 A204372 A123587 * A058209 A160789 A131291

Adjacent sequences:  A018837 A018838 A018839 * A018841 A018842 A018843

KEYWORD

nonn

AUTHOR

Marc LeBrun (mlb(AT)well.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 11:51 EST 2012. Contains 205908 sequences.