|
Search: id:A038522
|
|
|
| A038522 |
|
On (2n+1)X(2n+1) board, let m(i)=number of squares i knight's moves from center; sequence gives max m(i), i=0,... |
|
+0
2
|
|
| 1, 1, 8, 20, 32, 52, 68, 76, 96, 96, 120, 120, 148, 144, 176, 168, 204, 188
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Problem E2605*, Labels on a Chessboard, proposed by Andreas P. Hadjipolakis, Anopolis Sfakion, Crete, Greece, Am. Math. Monthly Vol. 83 (1976), no. 7 (Aug-Sept.), p. 566. Solution: Vol. 84 (1977), p. 822 by Roger Weitzenkamp.
|
|
EXAMPLE
|
On 5 X 5 board, [ m(0),...,m(4) ]=[ 1,8,8,4,4 ], max=8, so a(2)=8.
|
|
CROSSREFS
|
Cf. A018842.
Sequence in context: A110116 A022757 A017617 this_sequence A139570 A004118 A073607
Adjacent sequences: A038519 A038520 A038521 this_sequence A038523 A038524 A038525
|
|
KEYWORD
|
nonn,walk,nice
|
|
AUTHOR
|
xpolakis(AT)hol.gr (Antreas P. Hatzipolakis)
|
|
|
Search completed in 0.002 seconds
|
