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.

A081325 a(n) = sigma(n^2) modulo 4.

Original entry on oeis.org

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

Views

Author

Benoit Cloitre, Apr 20 2003

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Mod[DivisorSigma[1, n^2], 4]; Array[a, 100] (* Amiram Eldar, May 03 2025 *)
  • PARI
    a(n) = sigma(n^2) % 4; \\ Amiram Eldar, May 03 2025

Formula

From Amiram Eldar, May 03 2025: (Start)
a(n) = A010873(A065764(n)).
a(A081339(n)) = 1.
a(A081354(n)) = 3. (End)