login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051659 Experimental values for maximal number of "loose" circles in packing equal circles into a square. 0
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 1, 0, 0, 1, 0, 2, 0, 2, 1, 0, 0, 0, 2, 0, 1, 1, 0, 4, 3, 1, 0, 0, 0, 0, 0, 0, 2, 1, 0, 1, 4, 3, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

REFERENCES

H. T. Croft, K. J. Falconer and R. K. Guy: Unsolved problems in geometry, Springer, New York, 1991.

LINKS

Table of n, a(n) for n=1..46.

D. Boll, Optimal Packing Of Circles And Spheres

E. Friedman, Erich's Packing Center

C. D. Maranas, C. A. Floudas and P. M. Pardalos, New results in the packing of equal circles in a square, Discrete Mathematics 142 (1995), p. 287-293.

K. J. Nurmela and Patric R. J. Östergård, Packing up to 50 equal circles in a square, Discrete Comput. Geom. 18 (1997) 1, p. 111-120.

E. Specht, www.packomania.com

CROSSREFS

Sequence in context: A343746 A227990 A101614 * A085861 A326197 A325226

Adjacent sequences:  A051656 A051657 A051658 * A051660 A051661 A051662

KEYWORD

nonn

AUTHOR

Eckard Specht (eckard.specht(AT)physik.uni-magdeburg.de)

EXTENSIONS

I do not know how many of these values have been rigorously proved. - N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 08:07 EDT 2021. Contains 343940 sequences. (Running on oeis4.)