Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Aug 03 2023 10:31:19
%S 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,1,1,0,
%T 0,0,0,1,0,0,1,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,1,0,0,0,0,1,1,1,1,0,0,0,
%U 1,0,0,0,1,0,0,1,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,1,1,0,0,0,1,1,0
%N Lexicographically earliest de Bruijn sequence for n = 8 and k = 2.
%H Ray Chandler, <a href="/A169674/b169674.txt">Table of n, a(n) for n = 0..1023</a>
%H Frank Ruskey, <a href="http://combos.org/necklace">Generate Necklaces</a>
%H <a href="/index/Rec#order_256">Index entries for linear recurrences with constant coefficients</a>, order 256.
%e Periodic with period 256, the period being:
%e 0000000010000001100000101000001110000100100001011000011010000111100010\
%e 0010011000101010001011100011001000110110001110100011111001001010010011\
%e 1001010110010110100101111001100110101001101110011101100111101001111110\
%e 1010101110101101101011111011011110111011111111
%Y Cf. A021913, A169675, A080679, A169672, A169671, A169673.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Apr 11 2010