A124484 - OEIS

This site is supported by donations to The OEIS Foundation.

A124484

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

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; internal format)

	OFFSET	`0,3`
	COMMENTS	`I don't know how many of these entries have been proved to be optimal. The Erdos-Graham paper shows how subtle such problems can be. - N. J. A. Sloane (njas(AT)research.att.com), Dec 19 2006`
	REFERENCES	`P. Erdos and R. L. Graham, On packing squares with equal squares, J. Comb. Theory (A), 19 (1975), 119-123.`
	LINKS	`Erich Friedman, Packing Problems` `Jason Holt, Packing squares into circles`
	CROSSREFS	`Sequence in context: A154894 A179681 A000567 * A137742 A190456 A188026` `Adjacent sequences: A124481 A124482 A124483 * A124485 A124486 A124487`
	KEYWORD	`nonn`
	AUTHOR	`Jason Holt (oeis(AT)lunkwill.org), Nov 10 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:30 EST 2012. Contains 206009 sequences.