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.

A065252 The sequence A065251 reduced modulo 3 (i.e., replace every -1 with 2).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Oct 25 2001

Keywords

Programs

  • Maple
    [seq((A065251(j) mod 3),j=1..120)];

Formula

a(0)=0, a(2n) = 2 - a(n), a(2n+1) = 2 - ((a(n)+1) mod 3).