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

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

0,2

FORMULA

For n >= 14, a(n) = a(n-5) + 2 (David W. Wilson).

CROSSREFS

Sequence in context: A002849 A163234 A072984 * A138125 A098793 A083220

Adjacent sequences:  A018838 A018839 A018840 * A018842 A018843 A018844

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 14 15:31 EST 2012. Contains 205634 sequences.