%I A037188
%S A037188 0,0,1,1,0,2,0,0,0,1,0,2,1,3,1,1,0,2,0,2,0,1,1,2,2,0,0,0,1,1,2,1,0,0,1,
               1,0,
%T A037188 1,0,0,0,1,0,1,0
%N A037188 Number of ways of placing 2n points on n X n grid so no 3 are in a line 
               (solutions with symmetry about both main diagonals).
%D A037188 A. Flammenkamp, Progress in the no-three-in-line problem, J. Combinat. 
               Theory A 60 (1992), 305-311.
%D A037188 A. Flammenkamp, Progress in the no-three-in-line problem. II. J. Combin. 
               Theory Ser. A 81 (1998), no. 1, 108-113.
%H A037188 A. Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/
               table_old.txt">Solutions of the no-three-in-line problem</a>
%H A037188 A. Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/
               table.txt">Solutions of the no-three-in-line problem</a>
%Y A037188 Cf. A000769.
%Y A037188 Sequence in context: A024153 A079127 A056674 this_sequence A086079 A133703 
               A073265
%Y A037188 Adjacent sequences: A037185 A037186 A037187 this_sequence A037189 A037190 
               A037191
%K A037188 nonn
%O A037188 1,6
%A A037188 N. J. A. Sloane (njas(AT)research.att.com).
%E A037188 More terms from Flammenkamp web site, May 24 2005