|
|
A322345
|
|
Maximal number of vertices of a convex lattice polygon containing n lattice points in its interior.
|
|
7
|
|
|
4, 6, 6, 6, 8, 7, 8, 9, 8, 8, 10, 9, 9, 10, 10, 10, 10, 11, 10, 12, 12, 12, 11, 11, 12, 12, 12, 13, 12, 12, 13, 13, 13, 13, 14, 14, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 14, 15, 15, 15, 15, 15, 16, 15, 16, 15, 16, 16, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 16, 17, 17, 16, 17, 17
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
This is an inverse of A063984 in the following sense: A063984(k) = min {n : a(n)>=k}. Thus a(n) grows roughly like const*n^(1/3). - Günter Rote, Sep 19 2023
|
|
LINKS
|
Wouter Castryck, Homepage. See the accompanying files for the above-referenced paper.
|
|
PROG
|
(Python) # See the Python program in the links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|