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 A169676 #17 Aug 01 2025 11:12:24
%S A169676 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,
%T A169676 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,
%U A169676 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
%N A169676 Lexicographically earliest de Bruijn sequence for n = 2 and k = 3.
%H A169676 Frank Ruskey, <a href="http://combos.org/bruijn">Generate de Bruijn sequences</a>
%H A169676 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,1).
%e A169676 Periodic with period 9, the period being 001021122.
%t A169676 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 *)
%Y A169676 Cf. A021913, A169675, A080679, A169672, A169671, A169673, A169674.
%K A169676 nonn,easy
%O A169676 0,5
%A A169676 _N. J. A. Sloane_, Apr 11 2010
%E A169676 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, ...