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.

A093719 a(n) = (n mod 2)^(n mod 3).

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Apr 12 2004

Keywords

Comments

This is a periodic sequence with period 6. The repeating block is 1,1,0,1,0,1. - Michel Dekking, Sep 19 2020

Crossrefs

Programs

Formula

a(n) = A000035(n)^A010872(n).
a(A047273(n)) = 1, a(A047235(n)) = 0. [Reinhard Zumkeller, Oct 01 2008]
G.f.: -(x^5 + x^3 + x + 1)/(x^6 - 1). - Colin Barker, Apr 01 2013
E.g.f.: (2*cos(sqrt(3)*x/2)*cosh(x/2) + cosh(x))/3 + sinh(x). - Stefano Spezia, Jul 26 2024