cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Stefan Hannie

Stefan Hannie's wiki page.

Stefan Hannie has authored 1 sequences.

A191101 Number of regions in a complete but borderless regular polygon.

Original entry on oeis.org

6, 18, 43, 72, 145, 210, 364, 432, 768, 938, 1441, 1680, 2483, 2448, 4010, 4480, 6154, 6798, 9063, 9000, 12901, 13962, 17848, 19152, 24100, 21450, 31869, 33824, 41383, 43758, 52886, 52920, 66638, 69958, 82915, 86760, 102009
Offset: 5

Views

Author

Stefan Hannie, May 25 2011

Keywords

Comments

A complete borderless polygon is one where each vertex is connected to every other vertex except for adjacent vertices. Adjacent vertices are not connected by edges. The result is a polygon interior.

Crossrefs

Cf. A007678.

Formula

a(n) = A007678(n) - n.

Extensions

a(8) onward corrected by T. D. Noe, Jun 02 2011

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.