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 A011751 #23 Feb 23 2018 11:55:44
%S A011751 1,1,1,0,1,0,0,0,1,0,0,1,0,1,0,1,1,0,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,
%T A011751 0,1,0,0,0,1,0,0,1,0,1,0,1,1,0,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0,1,0,
%U A011751 0,0,1,0,0,1,0,1,0,1,1,0,0
%N A011751 Expansion of (1 + x^4)/(1 + x + x^3 + x^4 + x^5) mod 2.
%H A011751 Muniru A Asiru, <a href="/A011751/b011751.txt">Table of n, a(n) for n = 0..1000</a>
%H A011751 Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%H A011751 R. Gold, <a href="http://dx.doi.org/10.1137/0114079">Characteristic linear sequences and their coset functions</a>, J. SIAM Applied. Math., 14 (1966), 980-985.
%H A011751 <a href="/index/Rec#order_31">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, 1), i.e., 31-periodic.
%F A011751 a(n+31) = a(n) for all n. - _M. F. Hasler_, Feb 17 2018
%p A011751 series((1+x^4)/(1+x+x^3+x^4+x^5),x,100) mod 2;
%p A011751 [seq(coeff(series((1+x^4)/(1+x+x^3+x^4+x^5),x,100) mod 2,x,n),n=0..80)]; # _Muniru A Asiru_, Feb 18 2018
%p A011751 A011751 := n -> coeftayl((1+x^4)/(1+x+x^3+x^4+x^5),x=0,n) mod 2 # _M. F. Hasler_, Feb 18 2018
%t A011751 Mod[ CoefficientList[ Series[(1 + x^4)/(1 + x + x^3 + x^4 + x^5), {x, 0, 105}], x], 2] (* _Robert G. Wilson v_, Feb 19 2018 *)
%o A011751 (PARI) a(n)=bittest(1826728215,n%31) \\ _M. F. Hasler_, Feb 17 2018
%Y A011751 Cf. A011655..A011750 for other binary m-sequences.
%K A011751 nonn,easy
%O A011751 0,1
%A A011751 _N. J. A. Sloane_