|
Search: id:A036464
|
|
|
| A036464 |
|
Number of ways to place two nonattacking queens on an n X n board. |
|
+0
3
|
|
| 0, 0, 8, 44, 140, 340, 700, 1288, 2184, 3480, 5280, 7700, 10868, 14924, 20020, 26320, 34000, 43248, 54264, 67260, 82460, 100100, 120428, 143704, 170200, 200200, 234000, 271908, 314244, 361340, 413540, 471200, 534688, 604384
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
I. Rivin, I. Vardi and P. Zimmermann, The n-queens problem, Amer. Math. Monthly, 101 (1994), 629-639.
|
|
FORMULA
|
a(n) = C(n, 3)*(3*n-1).
|
|
CROSSREFS
|
Sequence in context: A046377 A075816 A100583 this_sequence A000938 A165618 A059596
Adjacent sequences: A036461 A036462 A036463 this_sequence A036465 A036466 A036467
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
R. G. Wilson, V; Raymond Bush (c17h21no4(AT)hotmail.com) and Kirk Conely; N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
