cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A127405 #2 Mar 31 2012 10:29:10
%S A127405 0,2,4,8,12,20,24,36,46,56,68,81,96,116,130,150,168,190,204,236
%N 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.
%C A127405 a(n)<= min(A127402(n),A127403(n),A127404(n)).
%H A127405 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a127405.pdf">Minimal number of points in the honeycomb lattice covered by circular disks.</a> Illustrations.
%Y A127405 Cf. A127402, A127403, A127404, A127406. The corresponding sequences for the square lattice and hexagonal lattice are A123689 and A125851, respectively.
%K A127405 more,nonn
%O A127405 1,2
%A A127405 _Hugo Pfoertner_, Feb 08 2007