|
| |
|
|
A085622
|
|
Maximal number of segments (equivalently, corners) in a rook circuit of a 2n X 2n board.
|
|
0
| |
|
|
1, 4, 12, 28, 56, 88, 132, 180, 240, 304, 380, 460, 552, 648, 756, 868, 992, 1120, 1260, 1404, 1560, 1720, 1892, 2068, 2256, 2448, 2652, 2860, 3080, 3304, 3540, 3780, 4032, 4288, 4556, 4828, 5112, 5400, 5700, 6004, 6320, 6640, 6972, 7308, 7656, 8008, 8372
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| Problem asked by Barry Cipra arising from Problem 89 of Vaderlind, Guy & Larson, The Inquisitive Problem Solver, MAA.
|
|
|
FORMULA
| a(n) = 4n^2 - 2n if n is even and 4n^2 - 2n - 2 if n is odd and > 1.
|
|
|
CROSSREFS
| Sequence in context: A184633 A006000 A161216 * A011940 A102653 A102650
Adjacent sequences: A085619 A085620 A085621 * A085623 A085624 A085625
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Jul 11 2003
|
|
|
EXTENSIONS
| More terms from David Wasserman (dwasserm(AT)earthlink.net), May 30 2004
|
| |
|
|
