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.

A126825 Ramanujan numbers (A000594) read mod 3.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Feb 25 2007

Keywords

Crossrefs

Programs

  • Maple
    seq(modp(numtheory:-sigma(n),3)*(1-abs(mods(n-1,3))), n=1..105); # Peter Luschny, Apr 26 2016
  • Mathematica
    Mod[RamanujanTau@ #, 3] & /@ Range@ 105 (* Michael De Vlieger, Apr 26 2016 *)
  • PARI
    a(n) = ramanujantau(n) % 3; \\ Amiram Eldar, Jan 05 2025

Formula

a(4*n) = a(n) (see Corollary 2.2. p. 726 of Ewell link). - Michel Marcus, Dec 23 2012
a(n) = sigma(n) mod 3, for n coprime to 3. - Michel Marcus, Apr 26 2016