|
Search: id:A063655
|
|
|
| A063655 |
|
Smallest semiperimeter of integral rectangle with area n. |
|
+0
9
|
|
| 2, 3, 4, 4, 6, 5, 8, 6, 6, 7, 12, 7, 14, 9, 8, 8, 18, 9, 20, 9, 10, 13, 24, 10, 10, 15, 12, 11, 30, 11, 32, 12, 14, 19, 12, 12, 38, 21, 16, 13, 42, 13, 44, 15, 14, 25, 48, 14, 14, 15, 20, 17, 54, 15, 16, 15, 22, 31, 60, 16, 62, 33, 16, 16, 18, 17, 68, 21, 26, 17, 72, 17, 74, 39
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
Since 15 = 1*15 = 3*5 and the 3*5 rectangle gives smallest semiperimeter 8, we have a(15)=8.
|
|
MAPLE
|
interface(quiet=true); for n from 1 to 100 do for i from floor(sqrt(n)) to 1 by -1 do j := floor(n / i); if (i * j = n) then printf("%d, ", i + j); break; end if; od; od; # from Winston C. Yang
|
|
CROSSREFS
|
Similar to A027709, which is minimal perimeter of polyomino of n cells, or equivalently, minimal perimeter of rectangle of area at least n and with integer sides. Present sequence is minimal semiperimeter of rectangle with area exactly n and with integer sides. - Winston C. Yang (winston(AT)cs.wisc.edu), Feb 03 2002
a(n) = A033676(n) + A033677(n).
Sequence in context: A091860 A071323 A071324 this_sequence A117248 A079788 A064553
Adjacent sequences: A063652 A063653 A063654 this_sequence A063656 A063657 A063658
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Jul 24 2001
|
|
EXTENSIONS
|
Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Dean Hickerson, Jul 26 2001
|
|
|
Search completed in 0.002 seconds
|
