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