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 A169672 #19 Jul 28 2025 09:00:28
%S A169672 0,0,0,0,0,1,0,0,0,1,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,0,
%T A169672 0,0,0,1,0,0,0,1,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,0,0,0,
%U A169672 0,1,0,0,0,1,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,0,0
%N A169672 Lexicographically earliest de Bruijn sequence for n = 5 and k = 2.
%H A169672 Frank Ruskey, <a href="http://combos.org/bruijn">Generate de Bruijn sequences</a>
%H A169672 <a href="/index/Rec#order_32">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).
%e A169672 Periodic with period 32, the period being: 00000100011001010011101011011111.
%t A169672 LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},{0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1},99] (* _Ray Chandler_, Aug 26 2015 *)
%Y A169672 Cf. A021913, A169675, A080679, A169671, A169673, A169674.
%K A169672 nonn,easy
%O A169672 0,1
%A A169672 _N. J. A. Sloane_, Apr 11 2010