|
%I #9 Dec 02 2018 04:09:09
%S 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,
%T 1,1,0,1,0,0,0,1,0,1,0
%N 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).
%H A. Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/table_old.txt">Solutions of the no-three-in-line problem</a>
%H A. Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/table.txt">Solutions of the no-three-in-line problem</a>
%H A. Flammenkamp, <a href="https://doi.org/10.1016/0097-3165(92)90012-J">Progress in the no-three-in-line problem</a>, J. Combinat. Theory A 60 (1992), 305-311.
%H A. Flammenkamp, <a href="https://doi.org/10.1006/jcta.1997.2829">Progress in the no-three-in-line problem. II</a>, J. Combin. Theory Ser. A 81 (1998), no. 1, 108-113.
%Y Cf. A000769.
%K nonn,more
%O 1,6
%A _N. J. A. Sloane_.
%E More terms from Flammenkamp web site, May 24 2005
|
