|
Search: id:A037188
|
|
|
| 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). |
|
+0
2
|
|
| 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, 1, 0, 0, 0, 1, 0, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
REFERENCES
|
A. Flammenkamp, Progress in the no-three-in-line problem, J. Combinat. Theory A 60 (1992), 305-311.
A. Flammenkamp, Progress in the no-three-in-line problem. II. J. Combin. Theory Ser. A 81 (1998), no. 1, 108-113.
|
|
LINKS
|
A. Flammenkamp, Solutions of the no-three-in-line problem
A. Flammenkamp, Solutions of the no-three-in-line problem
|
|
CROSSREFS
|
Cf. A000769.
Sequence in context: A024153 A079127 A056674 this_sequence A086079 A133703 A073265
Adjacent sequences: A037185 A037186 A037187 this_sequence A037189 A037190 A037191
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Flammenkamp web site, May 24 2005
|
|
|
Search completed in 0.006 seconds
|
