id:A084618 - OEIS Search Results

Search: id:A084618

Displaying 1-1 of 1 results found.

page 1

Maximum number of circles of area 1 that can be packed in a circle of area n.

+0
4

1, 1, 1, 2, 3, 4, 4, 5, 7, 7, 8, 8, 8, 9, 10, 11, 12, 13, 14, 14, 15, 16, 17, 19, 19, 19, 20, 21, 21, 22, 23, 24, 24, 26, 27, 27, 28, 29, 30, 31, 31, 32, 33, 34, 35, 37, 37, 37, 38, 39, 40, 40, 41, 42, 42, 43, 44, 45, 46, 47, 48, 48, 49, 50, 51, 52, 53, 55, 55, 55, 56, 57, 58, 59 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`For most values of n these are only conjectures, supported by numerical results.`
	REFERENCES	`For list of references given by E. Specht, see corresponding link.`
	LINKS	`Erich Friedman, Circles in Circles` `Hugo Pfoertner, Minimum area of circle needed to cover n circles of area 1` `E. Specht, The best known packings of equal circles in the unit circle`
	EXAMPLE	`a(4)=2 because a circle of area 4 is the smallest one covering two circles of area 1.` `a(9)=7 is the arrangement of 6 circles closely packed around another circle. This arrangement fits into a circle that has 3radius of smaller circles and thus 9their area.`
	CROSSREFS	`Cf. A084616, A023393, A084644.` `Sequence in context: A015745 A017854 A036416 this_sequence A075518 A036820 A017829` `Adjacent sequences: A084615 A084616 A084617 this_sequence A084619 A084620 A084621`
	KEYWORD	`hard,nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Jun 01 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research