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.

A105853 a(n) = sigma(n) (mod 10), i.e., unit's digit of sigma(n).

Original entry on oeis.org

1, 3, 4, 7, 6, 2, 8, 5, 3, 8, 2, 8, 4, 4, 4, 1, 8, 9, 0, 2, 2, 6, 4, 0, 1, 2, 0, 6, 0, 2, 2, 3, 8, 4, 8, 1, 8, 0, 6, 0, 2, 6, 4, 4, 8, 2, 8, 4, 7, 3, 2, 8, 4, 0, 2, 0, 0, 0, 0, 8, 2, 6, 4, 7, 4, 4, 8, 6, 6, 4, 2, 5, 4, 4, 4, 0, 6, 8, 0, 6, 1, 6, 4, 4, 8, 2, 0, 0, 0, 4, 2, 8, 8, 4, 0, 2, 8, 1, 6, 7, 2, 6, 4, 0, 2
Offset: 1

Views

Author

Shyam Sunder Gupta, May 05 2005

Keywords

Crossrefs

Sequences sigma(n) mod k: A053866 (k=2), A074941 (k=3), A105824 (k=4), A105825 (k=5), A084301 (k=6), A105826 (k=7), A105827 (k=8), A105852 (k=9), A105853 (k=10).

Programs

Formula

a(n) = A010879(A000203(n)). - Michel Marcus, Jul 26 2017