id:A108053 - OEIS Search Results

Search: id:A108053

Displaying 1-1 of 1 results found.

page 1

Maximum number of diagonals of a regular n-gon that meet at a non-center point.

+0
1

0, 2, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2 (list; graph; listen)

	OFFSET	`3,2`
	LINKS	`B. Poonen and M Rubinstein, The Number of Intersection Points Made by the Diagonals of a Regular Polygon, 1995.` `Sequences formed by drawing all diagonals in regular polygon`
	FORMULA	`Starting at a(5) = 2, sequence is periodic with period 30.`
	EXAMPLE	`In a 30-gon, there are non-center points where 7 diagonals meet, but no more than 7. Hence a(30) = 7.`
	CROSSREFS	`Sequence in context: A155679 A159580 A021448 this_sequence A133501 A124316 A061034` `Adjacent sequences: A108050 A108051 A108052 this_sequence A108054 A108055 A108056`
	KEYWORD	`easy,nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net), Jun 01 2005`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research