|
Search: id:A035005
|
|
|
| A035005 |
|
Number of possible queen moves on an n X n chessboard. |
|
+0
3
|
|
| 0, 12, 56, 152, 320, 580, 952, 1456, 2112, 2940, 3960, 5192, 6656, 8372, 10360, 12640, 15232, 18156, 21432, 25080, 29120, 33572, 38456, 43792, 49600, 55900, 62712, 70056, 77952, 86420, 95480, 105152, 115456, 126412, 138040, 150360
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The number of (2 to n) digit sequences that can be found reading in any orientation, including diagonals, in an (n X n) grid. - Paul Cleary (paulcleary(AT)blueyonder.co.uk), Aug 12 2005
|
|
FORMULA
|
a(n)=(n-1)*2*n^2 + (4*n^3-6*n^2+2*n)/3
|
|
EXAMPLE
|
3 X 3-board: queen has 8x6 moves and 1x8 moves, so a(3)=56
|
|
CROSSREFS
|
Cf. A033586, A035006-A035008.
Sequence in context: A133001 A104188 A069552 this_sequence A001386 A046998 A009430
Adjacent sequences: A035002 A035003 A035004 this_sequence A035006 A035007 A035008
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
Ulrich Schimke (ulrschimke(AT)aol.com)
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
|
Search completed in 0.002 seconds
|
