%I #29 Jun 30 2024 22:14:30
%S 0,0,0,1,1,1,1,0,1,0,1,1,0,0,1,0,0,0,1,1,1,1,0,1,0,1,1,0,0,1,0,0,0,1,
%T 1,1,1,0,1,0,1,1,0,0,1,0,0,0,1,1,1,1,0,1,0,1,1,0,0,1,0,0,0,1,1,1,1,0,
%U 1,0,1,1,0,0,1,0,0,0,1,1,1
%N A binary m-sequence: expansion of reciprocal of x^4+x+1.
%C Period 15: repeat 0,0,0,1,1,1,1,0,1,0,1,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_15">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).
%F a(n) = abs(a(n-1) - a(n-4)), where n > 3. - _Nicolas Bělohoubek_, Jun 28 2024
%F G.f.: x^3*(1 + x + x^2 + x^3 + x^5 + x^7 + x^8 + x^11)/(1 - x^15). - _Stefano Spezia_, Jun 29 2024
%t PadRight[{},120,{0,0,0,1,1,1,1,0,1,0,1,1,0,0,1}] (* _Harvey P. Dale_, Jul 21 2021 *)
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_