login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047932 Cumulative sum of number of new penny-penny contacts when putting pennies on a table following a spiral pattern. 1
0, 1, 3, 5, 7, 9, 12, 14, 16, 19, 21, 24, 26, 29, 31, 34, 36, 39, 42, 44, 47, 49, 52, 55, 57, 60, 63, 65, 68, 71, 73, 76, 79, 81, 84, 87, 90, 92, 95, 98, 100, 103, 106, 109, 111, 114, 117, 120, 122, 125, 128, 131, 133, 136, 139, 142, 144, 147, 150, 153, 156, 158, 161 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

This is the maximum possible number of contacts. It is also the maximum number of times the minimum distance can occur among n points in the plane.

REFERENCES

H. Harborth, Solution to problem 644A, Elemente der Mathematik (EMS Publishing House) 29, 14-15

LINKS

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

R. W. Grosse-Kunstleve, Penny Spiral Sequence

http://mathoverflow.net/questions/73621/maximal-number-of-edges-and-triangular-cells-for-n-points-in-a-triangular-lattice

FORMULA

a(n) = floor(3*n-sqrt(12*n-3))

CROSSREFS

Partial sums of A047931.

A186705 is the maximum number of times the *same* distance can occur between n points in the plane, not necessarily the *minimum*.

Sequence in context: A033036 A198082 A082767 * A139130 A219087 A186705

Adjacent sequences:  A047929 A047930 A047931 * A047933 A047934 A047935

KEYWORD

nonn

AUTHOR

Ralf W. Grosse-Kunstleve (rwgk(AT)cci.lbl.gov)

STATUS

approved

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

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

Last modified December 20 18:46 EST 2014. Contains 252288 sequences.