Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A018837
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A018837 Number of steps for knight to reach (n,0) on infinite chess-board. +0
1
0, 3, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 8, 9, 10, 11, 10, 11, 12, 13, 12, 13, 14, 15, 14, 15, 16, 17, 16, 17, 18, 19, 18, 19, 20, 21, 20, 21, 22, 23, 22, 23, 24, 25, 24, 25, 26, 27, 26, 27 (list; graph; listen)
OFFSET

0,2

FORMULA

2[ (n+2)/4 ] if n even, 2[ (n+1)/4 ]+1 if n odd (n >= 8).

G.f.: x(3-x+x^2-x^3-2x^4+2x^5)/((1-x)^2*(1+x)(1+x^2)). a(n)=A083219(n), n<>1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 15 2008]

CROSSREFS

Sequence in context: A095206 A049071 A029211 this_sequence A097618 A039639 A023509

Adjacent sequences: A018834 A018835 A018836 this_sequence A018838 A018839 A018840

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Marc LeBrun (mlb(AT)well.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research