Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127405
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127405 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 minimize the number of net points covered by the disk. +0
7
0, 2, 4, 8, 12, 20, 24, 36, 46, 56, 68, 81, 96, 116, 130, 150, 168, 190, 204, 236 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n)<= min(A127402(n),A127403(n),A127404(n)).

LINKS

Hugo Pfoertner, Minimal number of points in the honeycomb lattice covered by circular disks. Illustrations.

CROSSREFS

Cf. A127402, A127403, A127404, A127406. The corresponding sequences for the square lattice and hexagonal lattice are A123689 and A125851, respectively.

Sequence in context: A117455 A110571 A049696 this_sequence A136034 A059793 A118029

Adjacent sequences: A127402 A127403 A127404 this_sequence A127406 A127407 A127408

KEYWORD

more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Feb 08 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research