Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Feb 17 2018 13:52:19
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,
%T 0,0,0,1,1,0,1,0,1,1,0,1,0,0,1,1,1,1,1,0,0,0,1,0,1,0,0,0,0,1,1,1,1,0,
%U 0,1,0,1,0,0,1,1,0,0,0,1,1
%N A binary m-sequence: expansion of reciprocal of x^19 + x^6 + x^5 + x + 1 (mod 2, shifted by 18 initial 0's).
%C Sequence is 2^19-1 = 524287-periodic. - _M. F. Hasler_, Feb 17 2018
%D S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967.
%D H. D. Lueke, Korrelationssignale, Springer 1992, pp. 43-48.
%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 408.
%o (PARI) A=matrix(N=19,N,i,j, if(i>1, i==j+1, setsearch([1,5,6,N], j)>0))*Mod(1, 2); a(n)=lift((A^(n-#A+1))[1,1]) \\ _M. F. Hasler_, Feb 17 2018
%Y Cf. A011655..A011745 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2).
%K nonn
%O 0,1
%A _N. J. A. Sloane_
%E Edited by _M. F. Hasler_, Feb 17 2018