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