cp's OEIS Frontend

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.

A011741 A binary m-sequence: expansion of reciprocal of x^28 + x^3 + 1 (mod 2, shifted by 27 initial 0's).

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