Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110312
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110312 Minimal number of polygonal pieces in a dissection of a regular n-gon to a square (conjectured). +0
4
4, 1, 6, 5, 7, 5, 9, 7, 10, 6, 11, 10, 11, 11, 12, 12, 15, 14 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research