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!)
A115048 Count backwards from 100 in steps modulo n. 0

%I #4 Jun 09 2023 21:37:45

%S 100,100,99,96,95,90,84,80,72,70,66,60,52,42,30,16,0

%N Count backwards from 100 in steps modulo n.

%F a(n) = a(n-1)-(a(n-1 mod n), a(1)=100.

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

%Y Cf. A115020.

%K easy,fini,full,nonn

%O 1,1

%A _Zak Seidov_, Feb 28 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 June 24 18:26 EDT 2024. Contains 373688 sequences. (Running on oeis4.)