login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067168 A067156(n)/n. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 2, 0, 2, 2, 1, 2, 0, 3, 3, 1, 1, 4, 2, 0, 8, 5, 2, 3, 8, 0, 3, 2, 3, 10, 7, 5, 8, 1, 3, 4, 2, 4, 3, 4, 9, 4, 12, 9, 10, 3, 8, 9, 16, 11, 12, 3, 2, 10, 15, 21, 16, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

10,32

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

Table of n, a(n) for n=10..108.

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. A067156.

Sequence in context: A193291 A096936 A115979 * A099475 A120569 A128113

Adjacent sequences:  A067165 A067166 A067167 * A067169 A067170 A067171

KEYWORD

easy,nonn

AUTHOR

Sascha Kurz, Jan 06 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 04:15 EDT 2021. Contains 345395 sequences. (Running on oeis4.)