|
|
A124484
|
|
Maximal number of unit squares that can be packed into a circle of radius n.
|
|
0
|
|
|
0, 0, 8, 21, 40, 65, 97, 135, 180, 229, 286, 350, 419, 495, 575, 664, 761, 860, 966, 1079
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
I don't know how many of these entries have been proved to be optimal. The Erdős-Graham paper shows how subtle such problems can be. - N. J. A. Sloane, Dec 19 2006
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|