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.

A065251 Simple quasi-periodic sequence consisting of the terms 1, 0 and -1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Oct 25 2001

Keywords

Crossrefs

The same sequence modulo 3: A065252. Cf. A065249.

Programs

  • Maple
    [seq(A065251(j),j=1..120)]; A065251 := n -> 1-((n-2^floor_log_2(n)) mod 3);
  • Mathematica
    Table[1-Mod[n-2^Floor[Log[2,n]],3],{n,110}] (* Harvey P. Dale, Dec 25 2017 *)

Formula

a(n) = 1-((n-2^[log_2(n)]) mod 3)