|
%I #21 Feb 23 2018 03:34:11
%S 0,0,1,1,1,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,
%T 1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,0,0,1,1,1,
%U 0,1,0,0,1,1,1,0,1,0,0,1,1
%N A binary m-sequence: expansion of reciprocal of x^3 + x + 1 (mod 2, shifted by 2 initial 0's).
%C Period 7.
%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_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1).
%F G.f.: (x^6 + x^3 + x + 1)/(1-x^7), a(n+7) = a(n). - _Ralf Stephan_, Aug 05 2013
%t Join[{0, 0}, Mod[CoefficientList[1/(x^3 + x + 1) + O[x]^80, x], 2]] (* _Jean-François Alcover_, Feb 23 2018 *)
%o (PARI) A011657(n)=bittest(92,n%7) \\ _M. F. Hasler_, Feb 17 2018
%Y Cf. A011655..A011751 for other binary m-sequences.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
