Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118312
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118312 Number of squares on infinite chess-board that a knight can reach in n moves from a fixed square. +0
1
1, 8, 33, 76, 129, 196, 277, 372, 481, 604, 741, 892, 1057, 1236, 1429, 1636, 1857, 2092, 2341, 2604, 2881, 3172, 3477, 3796, 4129, 4476, 4837, 5212, 5601, 6004, 6421 (list; graph; listen)
OFFSET

0,2

COMMENT

Related to A018842: a(n)=A018842(n)+A018842(n-2)+A018842(n-4)+...

LINKS

Mordechai Katzman, Knight's moves on an infinite board (arXiv link)

FORMULA

a(n) = -3 + 4*n + 7*n^2 + 4*Sign[(n - 2)(n - 1)] - Anton Chupin (chupin(AT)icmm.ru), May 14 2006 generating function = (1 + 5*x + 12*x^2 - 8*x^4 + 4*x^5)/(1 - x)^3

EXAMPLE

a(2)=33 because knight in 2 moves from square (0,0) can reach one of the following squares: {{0,0}, {-4,-2}, {-4,0}, {-4,2}, {-3,-3}, {-3,-1}, {-3,1}, {-3,3}, {-2,-4}, {-2,0}, {-2,4}, {-1,-3}, {-1,-1}, {-1,1}, {-1,3}, {0,-4}, {0,-2}, {0,2}, {0,4}, {1,-3}, {1,-1}, {1,1}, {1,3}, {2,-4}, {2,0}, {2,4}, {3,-3}, {3,-1}, {3,1}, {3,3}, {4,-2}, {4,0}, {4,2}}

MATHEMATICA

Table[ -3 + 4*n + 7*n^2 + 4*Sign[(n - 2)(n - 1)], {n, 0, 100}]

CROSSREFS

Cf. A018842 (squares in EXACTLY n moves), A018836 (squares in <=n moves).

Adjacent sequences: A118309 A118310 A118311 this_sequence A118313 A118314 A118315

Sequence in context: A107291 A044466 A022274 this_sequence A140867 A114105 A014820

KEYWORD

easy,nice,nonn

AUTHOR

Anton Chupin (chupin(AT)icmm.ru), May 14 2006

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 November 3 12:59 EST 2009. Contains 165766 sequences.


AT&T Labs Research