%I A027709
%S A027709 0,4,6,8,8,10,10,12,12,12,14,14,14,16,16,16,16,18,18,18,18,20,20,20,20,
%T A027709 20,22,22,22,22,22,24,24,24,24,24,24,26,26,26,26,26,26,28,28,28,28,28,
%U A027709 28,28,30,30,30,30,30,30,30,32,32,32,32,32,32,32,32,34,34,34,34,34,34
%N A027709 Minimal perimeter of polyomino with n square cells.
%C A027709 a(n) = 2*A027434(n). - Tanya Khovanova (tanyakh(AT)yahoo.com), Mar 04 
               2008
%D A027709 F. Harary and H. Harborth, Extremal Animals, Journal of Combinatorics, 
               Information & System Sciences, Vol. 1, No 1, 1-8 (1976).
%D A027709 J. Yackel, R. R. Meyer and I. Christou, Minimum-perimeter domain assignment, 
               Mathematical Programming, vol. 78 (1997), pp. 283-303
%D A027709 W. C. Yang, Title?, PhD Dissertation, Computer Sciences Department, University 
               of Wisconsin-Madison, 2003.
%F A027709 a(n) = 2*ceil(2*sqrt(n))
%e A027709 a(5) = 10 because we can arrange 5 squares into 2 rows, with 2 squares 
               in the top row and 3 squares in the bottom row. This shape has perimeter 
               10, which is minimal for 5 squares.
%p A027709 interface(quiet=true); for n from 0 to 100 do printf("%d,", 2*ceil(2*sqrt(n))) 
               od;
%Y A027709 Cf. A000105, A067628 (analogue for triangles), A075777 (analogue for 
               cubes).
%Y A027709 Cf. A135711.
%Y A027709 Sequence in context: A159576 A163639 A095253 this_sequence A079775 A104173 
               A023991
%Y A027709 Adjacent sequences: A027706 A027707 A027708 this_sequence A027710 A027711 
               A027712
%K A027709 easy,nonn
%O A027709 0,2
%A A027709 Jonathan Custance (jevc(AT)atml.co.uk)
%E A027709 Edited by Winston C. Yang (winston(AT)cs.wisc.edu), Feb 02 2002