|
Search: id:A132293
|
|
|
| A132293 |
|
Maximal number of right angles in an n-gon. |
|
+0
1
|
| |
|
|
OFFSET
|
3,2
|
|
|
COMMENT
|
Conjecture from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 07 2008, Apr 21 2008: The correct sequence is a(n)=A014681(n-1), because a polyomino with a zigzag "stair" shape along a diagonal provides a solution where the number of right angles equals the number of edges:
|
|
EXAMPLE
|
The first (n=3) integer in this sequence is 1 because a triangle cannot have more than one right angle.
-----------
|.........|
|.........-
|.........
|.....
|...|
|.--
|.|
|--
|
|
CROSSREFS
|
Sequence in context: A099634 A109382 A090369 this_sequence A135103 A117893 A021701
Adjacent sequences: A132290 A132291 A132292 this_sequence A132294 A132295 A132296
|
|
KEYWORD
|
nonn,more,uned,obsc
|
|
AUTHOR
|
Asher Stuhlman (asherstuhlman(AT)gmail.com), Nov 06 2007
|
|
|
Search completed in 0.002 seconds
|
