|
|
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, 0, 0, 0, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 51, 0, 53, 0, 0, 0, 0, 0, 59, 0, 61, 0, 63, 0, 65, 0, 0, 0, 0, 0, 0, 0, 73, 0, 225, 76, 0, 0, 0, 0, 0, 0, 0, 0, 170, 0, 0, 0, 0, 0, 273, 0, 93, 0, 95, 0, 97, 0, 0, 0, 101, 102, 412
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 12,29
|
|
|
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(40)=40 because drawing the regular 40-gon with all its diagonals yields 40 12-gons.
|
|
|
CROSSREFS
| Cf. A007678, A064869, A067151, A067152, A067153, A067154, A067155, A067156, A067157, A067158.
Sequence in context: A112950 A173364 A023931 * A013306 A013373 A013375
Adjacent sequences: A067156 A067157 A067158 * A067160 A067161 A067162
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 06 2002
|
|
