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.

A115861 Number of distinct m's < n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 07 2006

Keywords

Crossrefs

a(2n) = a(n). Cf. A115859, A115869, A115871.