login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090175 a(n) = Mod[n,10+Sum[Mod[Floor[n/10^m],10],{m,1,10}]] 0
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; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A variable cycle function based on powers of ten.

LINKS

Table of n, a(n) for n=1..91.

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: A329200 A122638 A297235 * A275010 A010880 A261424

Adjacent sequences:  A090172 A090173 A090174 * A090176 A090177 A090178

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Jan 19 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 17:37 EDT 2020. Contains 334684 sequences. (Running on oeis4.)