Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037186
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
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; listen)
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: A079134 A163940 A112340 this_sequence A004483 A085650 A109450

Adjacent sequences: A037183 A037184 A037185 this_sequence A037187 A037188 A037189

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research