%I A080679
%S A080679 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,
%T A080679 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,
%U A080679 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
%N A080679 Example of de Bruijn cycle of length 16 (repeated indefinitely)
%D A080679 N. G. de Bruijn, A combinatorial problem, Koninklijke Nederlandse Akademie 
               v. Wetenschappen 49, 758-764, 1946.
%D A080679 F. R. K. Chung, P. Diaconis and R. L. Graham, Universal cycles for combinatorial 
               structures, Discr. Math., 110 (1992), 43-59.
%D A080679 S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967, 
               Chap. VI, Section 2.2.
%H A080679 Alex Bogomolny, <a href="http://www.cut-the-knot.com/ctk/FromLCarrollToArchimedes.shtml">
               Lewis Carroll to Archimedes</a>
%F A080679 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]}.
%F A080679 Periodic with period 16.
%Y A080679 Sequence in context: A080343 A011664 A094091 this_sequence A144193 A011662 
               A011665
%Y A080679 Adjacent sequences: A080676 A080677 A080678 this_sequence A080680 A080681 
               A080682
%K A080679 nonn
%O A080679 0,1
%A A080679 N. J. A. Sloane (njas(AT)research.att.com), Mar 03 2003