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 A011743 #10 Feb 17 2018 13:53:40 %S A011743 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,1,1,1,1, %T A011743 1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,0, %U A011743 1,0,1,0,1,0,0,1,0,1,0,1,0 %N A011743 A binary m-sequence: expansion of reciprocal of x^30 + x^16 + x^15 + x + 1 (mod 2, shifted by 29 initial 0's). %C A011743 Periodic with length of period 2^30-1. - _M. F. Hasler_, Feb 17 2018 %D A011743 S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967. %D A011743 H. D. Lueke, Korrelationssignale, Springer 1992, pp. 43-48. %D A011743 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 408. %o A011743 (PARI) A011743_vec=concat([1..29]*0, Vec(1/(x^30+x^16+x^15+x+1)+O(x^99))%2) %o A011743 A=matrix(30, 30, i, j, if(i>1, i==j+1, setsearch([1,15,16,30], j)>0))*Mod(1, 2); %o A011743 A011743(n)=lift((A^(n-29))[1, 1]) \\ _M. F. Hasler_, Feb 17 2018 %Y A011743 Cf. A011655, A011656, ..., A011745 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2). %K A011743 nonn %O A011743 0,1 %A A011743 _N. J. A. Sloane_