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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067169 A067157(n)/n. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 1, 0, 0, 5, 1, 3, 2, 1, 0, 3, 1, 2, 1, 2, 1, 3, 0, 3, 1, 6, 4, 3, 0, 2, 2, 9, 3, 1, 2, 6, 3, 10, 1, 5, 1, 15, 1, 8, 1, 10, 4, 11, 1, 11, 4, 15, 4, 15, 3, 17, 5, 14, 9, 10, 3, 10, 8, 20, 9, 18, 6, 13, 4, 12 (list; graph; refs; listen; history; internal format)
OFFSET

11,19

REFERENCES

B. Poonen and M. Rubinstein, Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics, Vol. 11, pp. 135-156.

LINKS

Sascha Kurz, m-gons in regular n-gons

B. Poonen and M. Rubinstein, The number of intersection points made by the diagonals of a regular polygon, SIAM J. on Discrete Mathematics, Vol. 11, No. 1, 135-156 (1998).

Sequences formed by drawing all diagonals in regular polygon

CROSSREFS

Cf. A067157.

Sequence in context: A022695 A197858 A060861 * A011339 A166243 A118514

Adjacent sequences:  A067166 A067167 A067168 * A067170 A067171 A067172

KEYWORD

easy,nonn

AUTHOR

Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 06 2002

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 17 19:13 EST 2012. Contains 206085 sequences.