login
Number of points in a 2-dimensional honeycomb net covered by a circular disk of diameter n if the center of the disk is chosen to maximize the number of net points covered by the disk.
8

%I #2 Mar 31 2012 10:29:10

%S 2,6,7,13,17,25,34,42,54,64,78,90,107,126,140,163,178,204,222,246

%N Number of points in a 2-dimensional honeycomb net covered by a circular disk of diameter n if the center of the disk is chosen to maximize the number of net points covered by the disk.

%C a(n)>= max(A127402(n),A127403(n),A127404(n)). a(n) is an upper limit for the number of path segments in A122223.

%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a127406.pdf">Maximal number of points in the honeycomb lattice covered by circular disks.</a> Illustrations.

%Y Cf. A127402, A127403, A127404, A127405, A122223. The corresponding sequences for the square lattice and hexagonal lattice are A123690 and A125852, respectively.

%K more,nonn

%O 1,1

%A _Hugo Pfoertner_, Feb 08 2007