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.

A090976 a(n) = 100 reduced mod n.

Original entry on oeis.org

0, 0, 1, 0, 0, 4, 2, 4, 1, 0, 1, 4, 9, 2, 10, 4, 15, 10, 5, 0, 16, 12, 8, 4, 0, 22, 19, 16, 13, 10, 7, 4, 1, 32, 30, 28, 26, 24, 22, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2, 0, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21
Offset: 1

Views

Author

Andy Edwards (AndynGen(AT)aol.com), Feb 28 2004

Keywords

Examples

			a(17)= 15 because [100/17] = 5, remainder is 15 (17*5 = 85, 100-85 = 15).
		

Programs

Formula

a(n) = 100 - n*[100/n] where [x] = floor.
a(n) = 100 for n > 100.

Extensions

More terms from David Wasserman, Feb 23 2006