id:A160860 - OEIS Search Results

Search: id:A160860

Displaying 1-1 of 1 results found.

page 1

The least possible number of pieces resulting from cutting a convex n-gon along all its diagonals.

+0
1

1, 4, 11, 24, 47, 80 (list; graph; listen)

	OFFSET	`3,2`
	COMMENT	`It seems that a(9)=137 and a(n) = A007678(n) for all even n.`
	LINKS	`Vladimir Letsko, Mathematical Marathon at dxdy` `Vladimir letsko, Mathematical Marathon fn vspu`
	CROSSREFS	`A006522, A007678` `Sequence in context: A006527 A057304 A001752 this_sequence A143075 A007678 A159350` `Adjacent sequences: A160857 A160858 A160859 this_sequence A160861 A160862 A160863`
	KEYWORD	`hard,more,nonn`
	AUTHOR	`Vladimir Letsko (val-etc(AT)yandex.ru), May 29 2009, May 30 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.