cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A011751 Expansion of (1 + x^4)/(1 + x + x^3 + x^4 + x^5) mod 2.

Original entry on oeis.org

1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A011655..A011750 for other binary m-sequences.

Programs

  • Maple
    series((1+x^4)/(1+x+x^3+x^4+x^5),x,100) mod 2;
    [seq(coeff(series((1+x^4)/(1+x+x^3+x^4+x^5),x,100) mod 2,x,n),n=0..80)]; # Muniru A Asiru, Feb 18 2018
    A011751 := n -> coeftayl((1+x^4)/(1+x+x^3+x^4+x^5),x=0,n) mod 2 # M. F. Hasler, Feb 18 2018
  • Mathematica
    Mod[ CoefficientList[ Series[(1 + x^4)/(1 + x + x^3 + x^4 + x^5), {x, 0, 105}], x], 2] (* Robert G. Wilson v, Feb 19 2018 *)
  • PARI
    a(n)=bittest(1826728215,n%31) \\ M. F. Hasler, Feb 17 2018

Formula

a(n+31) = a(n) for all n. - M. F. Hasler, Feb 17 2018