|
Search: id:A059173
|
|
|
| A059173 |
|
Maximal number of regions into which 4-space can be divided by n hyper-spheres. |
|
+0
6
|
|
| 1, 2, 4, 8, 16, 32, 62, 114, 198, 326, 512, 772, 1124, 1588, 2186, 2942, 3882, 5034, 6428, 8096, 10072, 12392, 15094, 18218, 21806, 25902, 30552, 35804, 41708, 48316, 55682, 63862, 72914, 82898, 93876, 105912, 119072, 133424, 149038
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
2 * A000127(n).
|
|
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). A row of A059250.
Sequence in context: A007813 A005309 A078389 this_sequence A027560 A135493 A111663
Adjacent sequences: A059170 A059171 A059172 this_sequence A059174 A059175 A059176
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 15 2001
|
|
|
Search completed in 0.002 seconds
|
