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.

A283497 Remainder when n is divided by A004074(n), or -1 if A004074(n) = 0.

Original entry on oeis.org

0, -1, 0, -1, 0, 0, 0, -1, 0, 0, 2, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, 2, 3, 0, 0, 2, 0, 0, 2, 0, 0, -1, 0, 0, 2, 0, 2, 2, 4, 4, 6, 0, 1, 4, 3, 6, 5, 0, 0, 2, 2, 4, 4, 0, 6, 2, 2, 2, 4, 0, 1, 0, 0, -1, 0, 0, 1, 0, 4, 4, 1, 0, 3, 2, 3, 4, 5, 8, 2, 0, 4, 10, 6, 0, 8, 6, 10, 4
Offset: 1

Views

Author

Altug Alkan, Mar 11 2017

Keywords

Examples

			a(11) = 2 because remainder when 11 is divided by A004074(11) = 3 is 2.
		

Crossrefs

Formula

a(2^n) = -1 for n > 0.