id:A067168 - OEIS Search Results

Search: id:A067168

Displaying 1-1 of 1 results found.

page 1

A067156(n)/n.

+0
2

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

	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	`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: A060514 A096936 A115979 this_sequence A099475 A120569 A128113` `Adjacent sequences: A067165 A067166 A067167 this_sequence A067169 A067170 A067171`
	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 July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research