

A124484


Maximal number of unit squares that can be packed into a circle of radius n.


1



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ősGraham paper shows how subtle such problems can be.  N. J. A. Sloane, Dec 19 2006


LINKS

Table of n, a(n) for n=0..19.
P. Erdős and R. L. Graham, On packing squares with equal squares, J. Comb. Theory (A), 19 (1975), 119123.
Erich Friedman, Packing Problems
Jason Holt, Packing squares into circles


CROSSREFS

Sequence in context: A279895 A225287 A000567 * A137742 A275874 A190456
Adjacent sequences: A124481 A124482 A124483 * A124485 A124486 A124487


KEYWORD

nonn,more


AUTHOR

Jason Holt, Nov 10 2006


STATUS

approved



