%I #19 Feb 23 2018 04:26:56

%S 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,0,0,0,0,1,1,1,

%T 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,

%U 0,1,0,1,0,1,0,1,0,1,0,1,0

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

%C Periodic with period 2^32-1 = 3*5*17*257*65537 = 4294967295. - _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.

%H <a href="/index/Rec#order_4294967295">Index entries for linear recurrences with constant coefficients</a>, order 4294967295.

%H <a href="/index/Per#periodic">Index entries for periodic sequences with large period</a>.

%t Join[Table[0, 31], Mod[CoefficientList[1/(x^32 + x^28 + x^27 + x + 1) + O[x]^50, x], 2]] (* _Jean-François Alcover_, Feb 23 2018 *)

%o (PARI) A011745_vec=concat([1..31]*0,Vec(1/(x^32+x^28+x^27+x+1)+O(x^99))%2)

%o A=matrix(N=32,N,i,j,if(i>1,i==j+1,setsearch([1,27,28,N],j)))*Mod(1,2);

%o A011745(n)=lift((A^(n-#A+1))[1,1]) \\ _M. F. Hasler_, Feb 17 2018

%Y Cf. A011655..A011744 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2).

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

%E Edited by _M. F. Hasler_, Feb 17 2018