|
|
A132293
|
|
Maximal number of right angles in an n-gon.
|
|
0
|
|
|
|
OFFSET
|
3,2
|
|
COMMENTS
|
A proper definition is needed for this sequence.
Conjecture from R. J. Mathar, Mar 07 2008, Apr 21 2008: (Start)
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:
┌─────────┐
|. . . . .|
| ┘
|. . . . .
|
|. .|
| ┌─┘
|.|
└─┘
(End)
|
|
LINKS
|
|
|
EXAMPLE
|
The first (n=3) integer in this sequence is 1 because a triangle cannot have more than one right angle.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,uned,obsc
|
|
AUTHOR
|
Asher Stuhlman (asherstuhlman(AT)gmail.com), Nov 06 2007
|
|
STATUS
|
approved
|
|
|
|