|
Search: id:A059174
|
|
|
| A059174 |
|
Maximal number of regions into which 5-space can be divided by n hyper-spheres. |
|
+0
6
|
|
| 1, 2, 4, 8, 16, 32, 64, 126, 240, 438, 764, 1276, 2048, 3172, 4760, 6946, 9888, 13770, 18804, 25232, 33328, 43400, 55792, 70886, 89104, 110910, 136812, 167364, 203168, 244876, 293192, 348874, 412736, 485650, 568548, 662424, 768336
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 73, Problem 4.
|
|
FORMULA
|
n hyperspheres divide R^k into at most C(n-1, k) + Sum_{i=0..k} C(n, i) regions.
|
|
CROSSREFS
|
Cf. A014206 (dim 2), A046127 (dim 3), A059173 (dim 4), A059174 (dim 5).
Adjacent sequences: A059171 A059172 A059173 this_sequence A059175 A059176 A059177
Sequence in context: A115424 A008881 A069050 this_sequence A054044 A008859 A062257
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Feb 15 2001
|
|
|
Search completed in 0.002 seconds
|
