This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A169675 #18 Jul 28 2025 19:55:11
%S A169675 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,
%T A169675 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,
%U A169675 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
%N A169675 Lexicographically earliest de Bruijn sequence for n = 3 and k = 2.
%C A169675 The lexicographically earliest de Bruijn sequence for n = 2 and k = 2 is 0011 repeated (see A021913).
%H A169675 Frank Ruskey, <a href="http://combos.org/bruijn">Generate de Bruijn sequences</a>
%H A169675 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,1).
%e A169675 Periodic with period 8, the period being 00010111.
%t A169675 LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{0, 0, 0, 1, 0, 1, 1, 1},99] (* _Ray Chandler_, Aug 25 2015 *)
%t A169675 PadRight[{},120,{0,0,0,1,0,1,1,1}] (* _Harvey P. Dale_, Aug 01 2024 *)
%Y A169675 Cf. A021913, A080679, A169672, A169671, A169673, A169674.
%K A169675 nonn,easy
%O A169675 0,1
%A A169675 _N. J. A. Sloane_, Apr 11 2010