Search: id:A124484 Results 1-1 of 1 results found. %I A124484 %S A124484 0,0,8,21,40,65,97,135,180,229,286,350,419,495,575,664,761,860,966, %T A124484 1079 %N A124484 Maximal number of unit squares that can be packed into a circle of radius n. %C A124484 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 %D A124484 P. Erdos and R. L. Graham, On packing squares with equal squares, J. Comb. Theory (A), 19 (1975), 119-123. %H A124484 Erich Friedman, Packing Problems %H A124484 Jason Holt, Packing squares into circles %Y A124484 Sequence in context: A139590 A154894 A000567 this_sequence A137742 A152117 A075629 %Y A124484 Adjacent sequences: A124481 A124482 A124483 this_sequence A124485 A124486 A124487 %K A124484 nonn %O A124484 0,3 %A A124484 Jason Holt (oeis(AT)lunkwill.org), Nov 10 2006 Search completed in 0.001 seconds