Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115048 Count backwards from 100 in steps modulo n. +0
1
100, 100, 99, 96, 95, 90, 84, 80, 72, 70, 66, 60, 52, 42, 30, 16, 0 (list; graph; listen)
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: A020993 A115020 A096582 this_sequence A112525 A000865 A135600

Adjacent sequences: A115045 A115046 A115047 this_sequence A115049 A115050 A115051

KEYWORD

easy,fini,full,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research