Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090141
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090141 a(n) = Mod[n,4+Sum[Mod[Floor[n/4^m],4],{m,1,10}]] +0
1
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; listen)
OFFSET

1,2

COMMENT

A variable cycle rate based on powers of four.

The variable cycle function is chaotic.

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: A023868 A122275 A031235 this_sequence A049264 A010874 A125926

Adjacent sequences: A090138 A090139 A090140 this_sequence A090142 A090143 A090144

KEYWORD

nonn

AUTHOR

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

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research