login
This site is supported by donations 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; internal format)
OFFSET

1,1

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: A115020 A169735 A096582 * A112525 A000865 A135600

Adjacent sequences:  A115045 A115046 A115047 * A115049 A115050 A115051

KEYWORD

easy,fini,full,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Feb 28 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.