|
Search: id:A123689
|
|
|
| A123689 |
|
Number of points in a square lattice covered by a circle of diameter n if the center of the circle is chosen such that the circle covers the minimum possible number of lattice points. |
|
+0
5
|
|
| 0, 2, 4, 10, 16, 26, 32, 46, 60, 74, 88, 108, 124, 146, 172, 194, 216, 248, 276, 308
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n)<=min(A053411(n),A053414(n),A053415(n)).
|
|
LINKS
|
Hugo Pfoertner, Minimal number of points in the square lattice covered by circular disks. Illustrations.
|
|
EXAMPLE
|
a(1)=0: Circle with diameter 1 with center (0.5,0.5) covers no lattice points; a(2)=2: Circle with diameter 2 with center (0,eps) covers 2 lattice points;
a(3)=4: Cirle with diameter 3 with center (0.5,0.5) covers 4 lattice points.
|
|
CROSSREFS
|
Cf. A123690, A053411, A053414, A053415, A122224.
The corresponding sequences for the hexagonal lattice and the honeycomb net are A125851 and A127405, respectively.
Sequence in context: A096689 A039682 A111149 this_sequence A137928 A006584 A032246
Adjacent sequences: A123686 A123687 A123688 this_sequence A123690 A123691 A123692
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Oct 09 2006
|
|
|
Search completed in 0.002 seconds
|
