| 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, 35, 0, 0, 0, 0, 0, 123, 0, 0, 88, 45, 0, 0, 0, 0, 0, 51, 0, 0, 0, 165, 0, 114, 0, 118, 120, 61, 124, 0, 192, 195, 66, 67, 272, 138, 0, 568, 360, 146, 222, 600, 0, 231, 156, 237, 800, 567, 410, 664, 84, 255
(list; graph; listen)
|
|
|
OFFSET
|
9,27
|
|
|
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
|
|
EXAMPLE
|
a(9)=1 because drawing the regular 9-gon with all its diagonals yields 1 9-gon.
|
|
CROSSREFS
|
Cf. A007678, A067168, A064869, A067151, A067152, A067153, A067154, A067155, A067157, A067158, A067159.
Adjacent sequences: A067153 A067154 A067155 this_sequence A067157 A067158 A067159
Sequence in context: A129056 A005334 A033511 this_sequence A104785 A028847 A059023
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 06 2002
|
|
