|
|
A342269
|
|
Take a regular (2*n+1)-gon with all diagonals drawn; a(n) = number of edges in next-to-largest cell.
|
|
1
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
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?
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|