|
Search: id:A080679
|
|
|
| A080679 |
|
Example of de Bruijn cycle of length 16 (repeated indefinitely) |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
N. G. de Bruijn, A combinatorial problem, Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758-764, 1946.
F. R. K. Chung, P. Diaconis and R. L. Graham, Universal cycles for combinatorial structures, Discr. Math., 110 (1992), 43-59.
S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967, Chap. VI, Section 2.2.
|
|
LINKS
|
Alex Bogomolny, Lewis Carroll to Archimedes
|
|
FORMULA
|
a(n)=(1/240)*{16*(n mod 16)+[(n+1) mod 16]+[(n+2) mod 16]+[(n+3) mod 16]-14*[(n+4) mod 16]+16*[(n+5) mod 16]-14*[(n+6) mod 16]+16*[(n+7) mod 16]+[(n+8) mod 16]-14*[(n+9) mod 16]+[(n+10) mod 16]+16*[(n+11) mod 16]-14*[(n+12) mod 16]+[(n+13) mod 16]+[(n+14) mod 16]+[(n+15) mod 16]}.
Periodic with period 16.
|
|
CROSSREFS
|
Sequence in context: A080343 A011664 A094091 this_sequence A144193 A011662 A011665
Adjacent sequences: A080676 A080677 A080678 this_sequence A080680 A080681 A080682
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 03 2003
|
|
|
Search completed in 0.002 seconds
|
