Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037189
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A037189 Number of ways of placing 4n points on 2n x 2n grid so no 3 are in a line (solutions with 90 deg rotational symmetry). +0
2
0, 0, 3, 4, 6, 4, 13, 13, 7, 16, 8, 23, 36 (list; graph; listen)
OFFSET

1,3

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: A098744 A023823 A139186 this_sequence A047840 A107355 A083342

Adjacent sequences: A037186 A037187 A037188 this_sequence A037190 A037191 A037192

KEYWORD

nonn

AUTHOR

njas

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 July 25 02:12 EDT 2008. Contains 142294 sequences.


AT&T Labs Research