Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059250
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
5
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, 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, 114, 128, 74, 11, 1, 2, 4, 8, 16, 32, 64, 126, 198, 186, 92, 12, 1, 2, 4, 8, 16, 32, 64 (list; table; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research