Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A016031
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A016031
De Bruijn's sequence: 2^(2^(n-1) - n): ways of arranging 2^n bits in circle so all 2^n consecutive strings of length n are distinct.
+0
3
1, 1, 2, 16, 2048, 67108864, 144115188075855872, 1329227995784915872903807060280344576, 226156424291633194186662080095093570025917938800079226639565593765455331328
(
list
;
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 December 21 10:15 EST 2009. Contains 171081 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
