This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160860 The least possible number of pieces resulting from cutting a convex n-gon along all its diagonals. 3
 1, 4, 11, 24, 47, 80 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,2 COMMENTS It seems that a(9)=137 and a(n) = A007678(n) for all even n. LINKS Vladimir Letsko, Illustration of all cases for number of sides from 3 to 8 Vladimir Letsko, Illustration of all cases for number of sides from 3 to 8 [Cached copy, pdf version only] Vladimir Letsko, Proof for n = 7 and n = 8 and example for n = 9 (in Russian) Vladimir Letsko, Proof for n = 7 and n = 8 and example for n = 9 (in Russian). [Cached copy, pdf version only] V. A. Letsko, M. A. Voronina, Classification of convex polygons, Grani Poznaniya, 1(11), 2011. (in Russian) B. Poonen and M. Rubinstein, The number of intersection points made by the diagonals of a regular polygon. CROSSREFS Cf. A006522, A007678, A230281. Sequence in context: A167875 A057304 A001752 * A192748 A143075 A290707 Adjacent sequences:  A160857 A160858 A160859 * A160861 A160862 A160863 KEYWORD hard,more,nonn,nice AUTHOR Vladimir Letsko, May 29 2009, May 30 2009, Apr 20 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 10:45 EST 2019. Contains 329751 sequences. (Running on oeis4.)