%I #15 Aug 18 2017 09:58:09
%S 6,12,14,16,18,19,18,20,22,23,22
%N a(n) is the smallest number of faces of the triangular lattice required to enclose an area consisting of exactly n faces.
%F Conjecture: a(n) = 2*A067628(n) + 6.
%Y Triangular version of A235382.
%K nonn,more
%O 0,1
%A _Christian Majenz_, Aug 08 2017
|