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.

A342269 Take a regular (2*n+1)-gon with all diagonals drawn; a(n) = number of edges in next-to-largest cell.

Original entry on oeis.org

3, 5, 6, 6, 8, 7, 8, 8, 7, 8, 8, 8, 11, 10, 8, 9, 10, 8, 10, 14, 9, 10, 10, 12, 12, 10, 10, 12, 12, 12, 12, 10, 10, 11, 12, 12, 10, 10, 10, 10, 12, 10, 10, 12, 13, 12, 12, 11, 12, 12, 12, 12, 12, 10, 10, 12, 14, 14, 12, 12, 12, 10, 12, 12, 14, 12, 10, 12, 12
Offset: 2

Views

Author

Keywords

Comments

The largest cell has 2*n+1 sides, this is the runner-up.
It can be read off the rows of A331450.
It would be nice to know how fast this sequence grows. Is it unbounded?

Crossrefs