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 A011742 #13 Sep 27 2024 15:52:52
%S A011742 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,1,0,1,0,
%T A011742 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,
%U A011742 1,1,1,0,1,1,1,0,1,1,1,0,1
%N A011742 A binary m-sequence: expansion of reciprocal of x^29 + x^2 + 1 (mod 2, shifted by 28 initial 0's).
%C A011742 Periodic with period of length 2^29 - 1 = 536870911. - _M. F. Hasler_, Feb 17 2018
%D A011742 S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967.
%D A011742 H. D. Lueke, Korrelationssignale, Springer 1992, pp. 43-48.
%D A011742 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 408.
%t A011742 Join[PadRight[{},28,0],Mod[CoefficientList[Series[1/(x^29+x^2+1),{x,0,100}],x],2]] (* _Harvey P. Dale_, Sep 27 2024 *)
%o A011742 (PARI) A=matrix(29,29,i,j,if(i>1,i==j+1,setsearch([2,29],j)>0))*Mod(1,2); a(n)=lift((A^(n-28))[1,1]) \\ _M. F. Hasler_, Feb 17 2018
%Y A011742 Cf. A011655, A011656, ..., A011745 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2).
%K A011742 nonn
%O A011742 0,1
%A A011742 _N. J. A. Sloane_
%E A011742 Edited by _M. F. Hasler_, Feb 17 2018