A132293 Maximal number of right angles in an n-gon.

1, 4, 3, 4, 5, 6

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)

Possibly an incorrect version of A049008. - Michal Paulovic, Sep 27 2023

Links

Table of n, a(n) for n=3..8.

Example

The first (n=3) integer in this sequence is 1 because a triangle cannot have more than one right angle.

Crossrefs

Cf. A049008.

Sequence in context: A342843 A090369 A260031 * A205398 A135103 A369052

Adjacent sequences: A132290 A132291 A132292 * A132294 A132295 A132296

Keyword

nonn,more,uned,obsc

Author

Asher Stuhlman (asherstuhlman(AT)gmail.com), Nov 06 2007

Status

approved