login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037186 Number of ways of placing 2n points on n X n grid so no 3 are in a line (solutions with symmetry about one main diagonal). 1
0, 0, 0, 0, 2, 0, 1, 5, 3, 3, 6, 3, 9, 5, 13, 14, 12, 14, 16, 17, 13, 18, 34, 43, 55 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

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

CROSSREFS

Cf. A000769.

Sequence in context: A175528 A163940 A112340 * A004483 A197808 A085650

Adjacent sequences:  A037183 A037184 A037185 * A037187 A037188 A037189

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:25 EST 2012. Contains 205777 sequences.