The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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
100, 100, 99, 96, 95, 90, 84, 80, 72, 70, 66, 60, 52, 42, 30, 16, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = a(n-1)-(a(n-1 mod n), a(1)=100.
EXAMPLE
a(4) = 96 because a(3) = 99, 99 == 3 mod 4 and a(4) = 99 - 3 = 96.
CROSSREFS
Cf. A115020.
Sequence in context: A096582 A308660 A220023 * A112525 A000865 A135600
KEYWORD
easy,fini,full,nonn
AUTHOR
Zak Seidov, Feb 28 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 21:38 EDT 2024. Contains 372758 sequences. (Running on oeis4.)