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 A011740 #12 Feb 17 2018 15:25:33 %S A011740 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,1,1,0, %T A011740 0,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,0, %U A011740 1,1,1,1,1,1,1,0,0,0,0,0,1 %N A011740 A binary m-sequence: expansion of reciprocal of x^27 + x^8 + x^7 + x + 1 (mod 2, shifted by 26 initial 0's). %C A011740 Sequence is 2^27-1 = 134217727-periodic. - _M. F. Hasler_, Feb 17 2018 %D A011740 S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967. %D A011740 H. D. Lueke, Korrelationssignale, Springer 1992, pp. 43-48. %D A011740 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 408. %H A011740 <a href="/index/Rec#order_134217727">Index entries for linear recurrences with constant coefficients</a>, order 134217727. %H A011740 <a href="/index/Per#periodic">Index entries for periodic sequences with large period</a>. %F A011740 G.f. = x^26/(x^27 + x^8 + x^7 + x + 1) over GF(2). - _M. F. Hasler_, Feb 17 2018 %o A011740 (PARI) A=matrix(N=27,N,i,j, if(i>1, i==j+1, setsearch([1,7,8,N],j)>0))*Mod(1, 2); a(n)=lift((A^(n-#A+1))[1,1]) \\ _M. F. Hasler_, Feb 17 2018 %Y A011740 Cf. A011655..A011745 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2). %K A011740 nonn %O A011740 0,1 %A A011740 _N. J. A. Sloane_ %E A011740 Edited by _M. F. Hasler_, Feb 17 2018