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

0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0

Offset: 0

Author

N. J. A. Sloane, Apr 11 2010

Keywords

• nonn
• easy

Comments

The lexicographically earliest de Bruijn sequence for n = 2 and k = 2 is 0011 repeated (see A021913).

Examples

			Periodic with period 8, the period being 00010111.
		

Links

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

Crossrefs

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

Programs

Mathematica

LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{0, 0, 0, 1, 0, 1, 1, 1},99] (* Ray Chandler, Aug 25 2015 *)
PadRight[{},120,{0,0,0,1,0,1,1,1}] (* Harvey P. Dale, Aug 01 2024 *)