No 3 in line, in d dimensions (Neil Sloane)	Discuss about this problem
given d, find a subset S of {0,1,2}^d as big as possible with no 3 colinear points in it. A003142 2,6,16,43 A003142 Largest subset of 3 X 3 X ... X 3 cube (in n dimensions) with no 3 points colinear. Place the maximum number of points in a N^N N-dimensional cube, so that no line pass through 3 of these points.