A023393 - OEIS

This site is supported by donations to The OEIS Foundation.

A023393

Maximal number of circles of radius 1 that can be packed in a circle of radius n.

0, 1, 2, 7, 11, 19, 27, 38, 50, 64, 80, 98, 118 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,3`
	COMMENTS	`The terms for n>5 are only conjectures supported by extensive computations.`
	REFERENCES	`For list of references given by E. Specht, see corresponding link.`
	LINKS	`Table of n, a(n) for n=0..12.` `E. Specht, The best known packings of equal circles in the unit circle`
	CROSSREFS	`Cf. A084618, A084617, A084644.` `Cf. A201993 (conjectured lower bounds for a(n)).` `Sequence in context: A060191 A178899 * A084619 A106906 A106905 A097159` `Adjacent sequences: A023390 A023391 A023392 * A023394 A023395 A023396`
	KEYWORD	`more,nonn,hard`
	AUTHOR	`David W. Wilson`
	EXTENSIONS	`Terms for n>5 from Hugo Pfoertner, Jun 01 2003` `Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com.com), Feb 18 2004, writes to suggest that the sequence probably continues 138, 161, 187, 213, 242, 272, 304, 337, 373, 413, 451, 495, ...` `Edited by N. J. A. Sloane at the suggestion of David W. Wilson, Sep 22 2007` `Offset corrected by Jon Schoenfield, Oct 12 2008`
	STATUS	`approved`

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

Last modified June 19 10:05 EDT 2013. Contains 226401 sequences.