A169676 Lexicographically earliest de Bruijn sequence for n = 2 and k = 3.

0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 1, 1, 2, 2

Offset: 0

Author

N. J. A. Sloane, Apr 11 2010

Keywords

• nonn
• easy

Examples

			Periodic with period 9, the period being 001021122.
		

Links

• Frank Ruskey, Generate de Bruijn sequences
• Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,1).

Crossrefs

Cf. A021913, A169675, A080679, A169672, A169671, A169673, A169674.

Programs

Mathematica

LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 1},{0, 0, 1, 0, 2, 1, 1, 2, 2},99] (* Ray Chandler, Aug 26 2015 *)

Extensions

If someone would like to help, I would like to get analogous entries for k = 3 and n = 3,4,5,6; k = 4 and n = 2,3,4,5,6; k = 5 and n = 2,3,4,5,6; and n = 2 and k = 6,7,8,9, ...