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.

Showing 1-1 of 1 results.

A324472 a(n) = 1000 mod n.

Original entry on oeis.org

0, 0, 1, 0, 0, 4, 6, 0, 1, 0, 10, 4, 12, 6, 10, 8, 14, 10, 12, 0, 13, 10, 11, 16, 0, 12, 1, 20, 14, 10, 8, 8, 10, 14, 20, 28, 1, 12, 25, 0, 16, 34, 11, 32, 10, 34, 13, 40, 20, 0, 31, 12, 46, 28, 10, 48, 31, 14, 56, 40, 24, 8, 55, 40, 25, 10, 62, 48, 34, 20, 6, 64, 51, 38, 25, 12, 76
Offset: 1

Views

Author

N. J. A. Sloane, Mar 07 2019, following a suggestion from Charles Kusniec

Keywords

Examples

			a(98) = 1000 mod 98 = 20 as 1000 = 98 * 10 + 20. - _David A. Corneth_, Mar 07 2019
		

Crossrefs

Programs

Formula

a(n) = 1000 for n >= 1001.
a(n) = 0 <=> n in { A018767 }.
a(n) = 1 <=> n > 1 and n in { A018766 }.
Showing 1-1 of 1 results.