%I A059250
%S A059250 1,1,2,1,2,3,1,2,4,4,1,2,4,8,5,1,2,4,8,14,6,1,2,4,8,16,22,7,1,2,4,8,16,
               30,32,
%T A059250 8,1,2,4,8,16,32,52,44,9,1,2,4,8,16,32,62,84,58,10,1,2,4,8,16,32,64,
%U A059250 114,128,74,11,1,2,4,8,16,32,64,126,198,186,92,12,1,2,4,8,16,32,64
%N A059250 Square array T(k,n) = maximal number of regions into which k-space can 
               be divided by n hyper-spheres (k >= 1, n >= 1).
%D A059250 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 73, Problem 4.
%F A059250 n hyperspheres divide R^k into at most C(n-1, k) + Sum_{i=0..k} C(n, 
               i) regions.
%e A059250 Array begins
%e A059250 1 2 3 4 5 6 ...
%e A059250 1 2 4 8 14 22 ...
%e A059250 1 2 4 8 16 ...
%Y A059250 Cf. A014206 (dim 2), A046127 (dim 3), A059173 (dim 4), A059174 (dim 5).
%Y A059250 Apart from border, same as A059214.
%Y A059250 Sequence in context: A163491 A080772 A145111 this_sequence A104795 A116925 
               A131879
%Y A059250 Adjacent sequences: A059247 A059248 A059249 this_sequence A059251 A059252 
               A059253
%K A059250 nonn,tabl
%O A059250 1,3
%A A059250 N. J. A. Sloane (njas(AT)research.att.com), Feb 15 2001