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