Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090175
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090175 a(n) = Mod[n,10+Sum[Mod[Floor[n/10^m],10],{m,1,10}]] +0
1
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 14, 15 (list; graph; listen)
OFFSET

1,2

COMMENT

A variable cycle function based on powers of ten.

MATHEMATICA

digits=200 f[n_]=10+Sum[Mod[Floor[n/10^m], 10], {m, 1, 10}] a=Table[Mod[n, f[n]], {n, 1, digits}]

CROSSREFS

Sequence in context: A017884 A072139 A122638 this_sequence A010880 A097462 A010889

Adjacent sequences: A090172 A090173 A090174 this_sequence A090176 A090177 A090178

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 19 2004

page 1

Search completed in 0.003 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research