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.

A115048 Count backwards from 100 in steps modulo n.

Original entry on oeis.org

100, 100, 99, 96, 95, 90, 84, 80, 72, 70, 66, 60, 52, 42, 30, 16, 0
Offset: 1

Views

Author

Zak Seidov, Feb 28 2006

Keywords

Examples

			a(4) = 96 because a(3) = 99, 99 == 3 mod 4 and a(4) = 99 - 3 = 96.
		

Crossrefs

Cf. A115020.

Formula

a(n) = a(n-1)-(a(n-1) mod n), a(1)=100.
Showing 1-1 of 1 results.