|
Search: id:A125228
|
|
|
| A125228 |
|
Maximal number of squares of side 1 in a disk of radius n. |
|
+0
2
|
|
| 1, 7, 21, 39, 65, 93, 135, 179, 227, 285, 349, 415, 495, 573, 663, 759, 859, 963, 1071, 1199, 1325, 1457, 1591, 1735, 1891, 2049, 2207, 2383, 2557, 2735, 2929, 3123, 3327, 3529, 3739, 3955, 4191, 4427, 4665, 4901, 5159, 5413, 5681, 5951, 6231, 6515, 6799
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(2)=7 since you cannot pack more than 7 unit-side squares in a disk of radius 2
|
|
MATHEMATICA
|
f[n_] := 2 Sum[ IntegerPart[2 Sqrt[n^2 - (n - k - 1/2)^2]], {k, 0, n - 2}] + IntegerPart[2 Sqrt[n^2 - 1/2^2]]; Array[f, 47] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Similar to A001182 but less constrained.
Sequence in context: A009475 A063292 A045524 this_sequence A024837 A162818 A024966
Adjacent sequences: A125225 A125226 A125227 this_sequence A125229 A125230 A125231
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Filippo ALUFFI PENTINI (falpen(AT)gmail.com), Jan 25 2007
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Jan 27 2007
|
|
|
Search completed in 0.002 seconds
|
