cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 1, 2, 7, 11, 19, 27, 38, 50, 64, 80, 98, 118
Offset: 0

Views

Author

Keywords

Comments

The terms for n>5 are only conjectures supported by extensive computations.

References

  • R. L. Graham and B. D. Lubachevsky, Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4 and 5, Proc. First Int. Conf. "Computing and Combinatorics" COCOON'95, Springer Lecture Notes in Computer Science 959 (1996), 303-312.
  • For list of references given by E. Specht, see the Specht link.

Crossrefs

Cf. A201993 (conjectured lower bounds for a(n)).

Extensions

Terms for n>5 from Hugo Pfoertner, Jun 01 2003
Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.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 E. Schoenfield, Oct 12 2008