id:A124484 - OEIS Search Results

Search: id:A124484

Displaying 1-1 of 1 results found.

page 1

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

+0
2

0, 0, 8, 21, 40, 65, 97, 135, 180, 229, 286, 350, 419, 495, 575, 664, 761, 860, 966, 1079 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`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. - njas, 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: A090206 A139590 A000567 this_sequence A137742 A075629 A067334` `Adjacent sequences: A124481 A124482 A124483 this_sequence A124485 A124486 A124487`
	KEYWORD	`nonn`
	AUTHOR	`Jason Holt (oeis(AT)lunkwill.org), Nov 10 2006`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.