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.

A353640 Čiurlionis sequence A342002, reduced modulo 4.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 01 2022

Keywords

Crossrefs

Cf. A010873, A166486 (parity of terms), A342002, A353630.
Cf. A353641, A353642 (bisections).

Programs

  • PARI
    A353640(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= p^(e>0); s += (e/p); n = n\p; p = nextprime(1+p)); ((s*m)%4); };

Formula

a(n) = A010873(A342002(n)).
a(n) = A010873(A328572(n)*A353630(n)). [Note that all terms of A328572 are odd]