login

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”).

A011739
A binary m-sequence: expansion of reciprocal of x^26 + x^8 + x^7 + x + 1 (mod 2, shifted by 25 initial 0'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, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0
OFFSET
0,1
COMMENTS
Sequence is 2^26-1 = 67108863-periodic. - M. F. Hasler, Feb 17 2018
REFERENCES
S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967.
H. D. Lueke, Korrelationssignale, Springer 1992, pp. 43-48.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 408.
FORMULA
G.f. = x^25/(x^26 + x^8 + x^7 + x + 1), over GF(2). - M. F. Hasler, Feb 17 2018
PROG
(PARI) A=matrix(N=26, N, i, j, if(i>1, i==j+1, setsearch([1, 7, 8, N], j)>0))*Mod(1, 2); a(n)=lift((A^(n-#A+1))[1, 1]) \\ M. F. Hasler, Feb 17 2018
CROSSREFS
Cf. A011655..A011745 for other binary m-sequences, and A011746..A011751 for similar expansions over GF(2).
Sequence in context: A011740 A354344 A085974 * A023975 A305821 A305892
KEYWORD
nonn,easy
EXTENSIONS
Edited by M. F. Hasler, Feb 17 2018
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy