login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090976 a(n) = 100 reduced mod n. 2

%I #18 Jun 01 2020 11:05:04

%S 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,

%T 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,

%U 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

%N a(n) = 100 reduced mod n.

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

%F a(n) = 100 for n > 100.

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

%t Mod[100,Range[80]] (* _Harvey P. Dale_, Jun 01 2020 *)

%o (PARI) a(n) = 100 % n \\ _Michel Marcus_, Jun 29 2013

%K easy,nonn

%O 1,6

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

%E More terms from _David Wasserman_, Feb 23 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)