This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110898 Let fw[n_] := Mod[n, 4], fb[n_] := Mod[n, 3]; a(n) = a(n-a(n-1))+1+fw[n-a(n-2)]-fb[n-a(n-1)]. 1
 0, 1, 3, 3, 2, 6, 1, 3, 8, 3, 5, 2, 8, 8, 4, 4, 9, 8, 6, 11, 6, 7, 5, 7, 10, 7, 11, 9, 12, 7, 8, 6, 10, 9, 7, 14, 6, 9, 6, 12, 14, 11, 6, 9, 15, 9, 12, 15, 10, 15, 13, 5, 17, 7, 15, 14, 8, 18, 16, 10, 12, 18, 16, 15, 15, 14, 20, 15, 6, 18, 17, 17, 17, 7, 16, 9, 15, 15, 19, 13, 16, 13, 21, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS A modular chaotic recursive sequence with three functional parts on modulo 4 forward and modulo 3 backward functions. LINKS MATHEMATICA fw[n_] := Mod[n, 4] fb[n_] := Mod[n, 3] f[0] = 0; f[1] = 1; f[n_Integer?Positive] := f[n] = f[n - f[n - 1]] + 1 + fw[n - f[n - 2]] - fb[n - f[n - 1]] a = Table[f[n], {n, 0, 200}] CROSSREFS Sequence in context: A329690 A293521 A285443 * A264756 A267942 A147994 Adjacent sequences:  A110895 A110896 A110897 * A110899 A110900 A110901 KEYWORD nonn AUTHOR Roger L. Bagula, Sep 20 2005 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.

Last modified December 7 18:12 EST 2019. Contains 329847 sequences. (Running on oeis4.)