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!)
A090141 a(n) = Mod[n,4+Sum[Mod[Floor[n/4^m],4],{m,1,10}]] 0
1, 2, 3, 4, 0, 1, 2, 2, 3, 4, 5, 5, 6, 0, 1, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7, 2, 3, 4, 5, 1, 2, 3, 4, 0, 1, 2, 3, 8, 0, 1, 2, 6, 0, 1, 2, 4, 5, 6, 7, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 2, 3, 4, 5, 2, 3, 4, 5, 4, 5, 6, 7, 2, 3, 4, 5, 0, 1, 2, 3, 0, 1, 2, 3, 2, 3, 4, 5, 5, 6, 0, 1, 4, 5, 6, 7, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A variable cycle rate based on powers of four.

The variable cycle function is chaotic.

LINKS

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

MATHEMATICA

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

CROSSREFS

Sequence in context: A122275 A197024 A031235 * A049264 A010874 A330358

Adjacent sequences:  A090138 A090139 A090140 * A090142 A090143 A090144

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 1 13:59 EDT 2022. Contains 357149 sequences. (Running on oeis4.)