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 A011732 #11 Feb 17 2018 13:52:19 %S A011732 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0, %T A011732 0,0,0,1,1,0,1,0,1,1,0,1,0,0,1,1,1,1,1,0,0,0,1,0,1,0,0,0,0,1,1,1,1,0, %U A011732 0,1,0,1,0,0,1,1,0,0,0,1,1 %N A011732 A binary m-sequence: expansion of reciprocal of x^19 + x^6 + x^5 + x + 1 (mod 2, shifted by 18 initial 0's). %C A011732 Sequence is 2^19-1 = 524287-periodic. - _M. F. Hasler_, Feb 17 2018 %D A011732 S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967. %D A011732 H. D. Lueke, Korrelationssignale, Springer 1992, pp. 43-48. %D A011732 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 408. %o A011732 (PARI) A=matrix(N=19,N,i,j, if(i>1, i==j+1, setsearch([1,5,6,N], j)>0))*Mod(1, 2); a(n)=lift((A^(n-#A+1))[1,1]) \\ _M. F. Hasler_, Feb 17 2018 %Y A011732 Cf. A011655..A011745 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2). %K A011732 nonn %O A011732 0,1 %A A011732 _N. J. A. Sloane_ %E A011732 Edited by _M. F. Hasler_, Feb 17 2018