A067168 A067156(n)/n.

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

Offset: 10

Author

Sascha Kurz, Jan 06 2002

Keywords

• easy
• nonn

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