|
Search: id:A027709
|
|
|
| A027709 |
|
Minimal perimeter of polyomino with n square cells. |
|
+0
7
|
|
| 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, 20, 22, 22, 22, 22, 22, 24, 24, 24, 24, 24, 24, 26, 26, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 30, 30, 30, 30, 30, 30, 30, 32, 32, 32, 32, 32, 32, 32, 32, 34, 34, 34, 34, 34, 34
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) = 2*A027434(n). - Tanya Khovanova (tanyakh(AT)yahoo.com), Mar 04 2008
|
|
REFERENCES
|
F. Harary and H. Harborth, Extremal Animals, Journal of Combinatorics, Information & System Sciences, Vol. 1, No 1, 1-8 (1976).
J. Yackel, R. R. Meyer and I. Christou, Minimum-perimeter domain assignment, Mathematical Programming, vol. 78 (1997), pp. 283-303
W. C. Yang, Title?, PhD Dissertation, Computer Sciences Department, University of Wisconsin-Madison, 2003.
|
|
FORMULA
|
a(n) = 2*ceil(2*sqrt(n))
|
|
EXAMPLE
|
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.
|
|
MAPLE
|
interface(quiet=true); for n from 0 to 100 do printf("%d, ", 2*ceil(2*sqrt(n))) od;
|
|
CROSSREFS
|
Cf. A000105, A067628 (analogue for triangles), A075777 (analogue for cubes).
Cf. A135711.
Sequence in context: A159576 A163639 A095253 this_sequence A079775 A104173 A023991
Adjacent sequences: A027706 A027707 A027708 this_sequence A027710 A027711 A027712
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Custance (jevc(AT)atml.co.uk)
|
|
EXTENSIONS
|
Edited by Winston C. Yang (winston(AT)cs.wisc.edu), Feb 02 2002
|
|
|
Search completed in 0.002 seconds
|
