login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090976 a(n) = 100 reduced mod n. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..79.

FORMULA

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

a(n) = 100 for n > 100.

EXAMPLE

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

PROG

(PARI) a(n) = 100 % n \\ Michel Marcus, Jun 29 2013

CROSSREFS

Sequence in context: A197291 A112983 A068454 * A156199 A135513 A176895

Adjacent sequences:  A090973 A090974 A090975 * A090977 A090978 A090979

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

More terms from David Wasserman, Feb 23 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 09:36 EST 2019. Contains 329953 sequences. (Running on oeis4.)