|
%I #18 Feb 23 2018 04:30:32
%S 0,0,0,0,1,0,1,0,1,1,1,0,1,1,0,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,1,0,0,0,
%T 0,1,0,1,0,1,1,1,0,1,1,0,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,1,0,0,0,0,1,0,
%U 1,0,1,1,1,0,1,1,0,0,0,1,1
%N A binary m-sequence: expansion of reciprocal of x^5 + x^2 + 1.
%C The auxiliary sequence with o.g.f. x^4/(1 + x^2 + x^5) can be obtained by deleting the first term in A088002 and flipping all signs. - _R. J. Mathar_, May 26 2008
%C Period 31: repeat 0,0,0,0,1,0,1,0,1,1,1,0,1,1,0,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,1. - _Ralf Stephan_, Aug 05 2013
%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_31">Index entries for linear recurrences with constant coefficients</a>, signature (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).
%t Join[Table[0, 4], Mod[CoefficientList[1/(x^5 + x^2 + 1) + O[x]^77, x], 2]] (* _Jean-François Alcover_, Feb 23 2018 *)
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
