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