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.

A109718 Periodic sequence with period {0,1,0,3}, or n^3 mod 4.

Original entry on oeis.org

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

Views

Author

Bruce Corrigan (scentman(AT)myfamily.com), Aug 09 2005

Keywords

Comments

Since n^(2k+1) mod 4 = n^3 mod 4 for k>1 this sequence also represents n^5 mod 4; and n^7 mod 4; etc.

Crossrefs

n mod 4 = A010873; n^2 mod 4 = A000035.
Cf. A110270; A131743. - Bruno Berselli, Mar 14 2011

Programs

Formula

a(n) = n^3 mod 4.
G.f. = (x+3*x^3)/(1-x^4).
a(n) = (n mod 2)*(n mod 4) = (1+(-1)^(n+1))*(2+i^(n+1))/2 with i=sqrt(-1). - Bruno Berselli, Mar 14 2011