id:A067169 - OEIS Search Results

Search: id:A067169

Displaying 1-1 of 1 results found.

page 1

A067157(n)/n.

+0
2

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; listen)

	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: A145881 A135313 A022695 this_sequence A011339 A166243 A118514` `Adjacent sequences: A067166 A067167 A067168 this_sequence A067170 A067171 A067172`
	KEYWORD	`easy,nonn`
	AUTHOR	`Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 06 2002`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research