|
|
A047932
|
|
a(n) = floor(3*n-sqrt(12*n-3)).
|
|
6
|
|
|
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
|
a(n) = cumulative sum of number of new penny-penny contacts when putting pennies on a table following a spiral pattern. This is the maximum possible number of contacts.
a(n) is also the maximum number of times the minimum distance can occur among n points in the plane [Harborth].
|
|
LINKS
|
|
|
FORMULA
|
a(n) = floor(3*n-sqrt(12*n-3)).
|
|
MATHEMATICA
|
Table[Floor[3n-Sqrt[12n-3]], {n, 70}] (* Harvey P. Dale, Dec 25 2014 *)
|
|
CROSSREFS
|
A186705 is the maximum number of times the *same* distance can occur between n points in the plane, not necessarily the *minimum*.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|