A169674 Lexicographically earliest de Bruijn sequence for n = 8 and k = 2.
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, 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, 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
Offset: 0
Examples
Periodic with period 256, the period being: 0000000010000001100000101000001110000100100001011000011010000111100010\ 0010011000101010001011100011001000110110001110100011111001001010010011\ 1001010110010110100101111001100110101001101110011101100111101001111110\ 1010101110101101101011111011011110111011111111
Links
- Ray Chandler, Table of n, a(n) for n = 0..1023
- Frank Ruskey, Generate de Bruijn sequences
- Index entries for linear recurrences with constant coefficients, order 256.