Fwd: minimal perimeter of a polyhex

[Maximilian Hasler]

I think this is twice
 A036496 Number of lines that intersect the first n points on a spiral
 on a triangular lattice. The spiral starts at (0,0), goes to (1,0) and
 (1/2,sqrt(3)/2) and continues counterclockwise.
        0, 3, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15,
 15, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21,
 21, 21, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25,
 26, 26, 26, 26, 27, 27, 27, 27, 27, 28, 28, 28, 28, 29, 29, 29, 29,
        COMMENT
 From a spiral of n triangular lattice points, we can get a polyhex of
 n hexagons with min perimeter by replacing each point on the spiral by
 a hexagon. - Winston C. Yang (winston(AT)cs.wisc.edu), Apr 30 2002

 Maximilian



 On Tue, Mar 4, 2008 at 10:20 AM, Tanya Khovanova
 <mathoflove-seqfan at yahoo.com> wrote:
 > Dear SeqFans,
 >
 >  I just submitted the sequence:
 >
 >  6, 10, 12, 14, 16, 18, 18, 20, 22, 22, 24, 24,
 >  Minimal perimeter of a polyhex with n cells.
 >
 >  I am surprised that this sequence wasn't there.
 >
 >  I calculated it manually. Anyone has a program dealing with polyhexes?
 >  Can someone extend it? Is there are program for polyhexes somewhere
 >  available for free use?
 >
 >  Best, Tanya
 >