Search: id:A059173
Results 1-1 of 1 results found.

%I A059173
%S A059173 1,2,4,8,16,32,62,114,198,326,512,772,1124,1588,2186,2942,3882,5034,
%T A059173 6428,8096,10072,12392,15094,18218,21806,25902,30552,35804,41708,
%U A059173 48316,55682,63862,72914,82898,93876,105912,119072,133424,149038
%N A059173 Maximal number of regions into which 4-space can be divided by n hyper-spheres.
%C A059173 2 * A000127(n).
%D A059173 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 73, Problem 4.
%F A059173 n hyperspheres divide R^k into at most C(n-1, k) + Sum_{i=0..k} C(n, 
               i) regions.
%Y A059173 Cf. A014206 (dim 2), A046127 (dim 3), A059173 (dim 4), A059174 (dim 5). 
               A row of A059250.
%Y A059173 Sequence in context: A007813 A005309 A078389 this_sequence A027560 A135493 
               A111663
%Y A059173 Adjacent sequences: A059170 A059171 A059172 this_sequence A059174 A059175 
               A059176
%K A059173 nonn
%O A059173 0,2
%A A059173 N. J. A. Sloane (njas(AT)research.att.com), Feb 15 2001

Search completed in 0.001 seconds