|
| |
|
|
A290648
|
|
a(n) is the smallest number of faces of the triangular lattice required to enclose an area consisting of exactly n faces.
|
|
0
|
|
|
|
6, 12, 14, 16, 18, 19, 18, 20, 22, 23, 22
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
|
|
|
FORMULA
|
Conjecture: a(n) = 2*A067628(n) + 6.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
