The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 LINKS Table of n, a(n) for n=0..83. MATHEMATICA fw[n_] := Mod[n, 4]; fb[n_] := Mod[n, 3]; a[0] = 0; a[1] = 1; a[n_Integer?Positive] := a[n] = a[n - a[n - 1]] + 1 + fw[n - a[n - 2]] - fb[n - a[n - 1]]; Table[a[n], {n, 0, 80}] CROSSREFS Sequence in context: A329690 A293521 A285443 * A264756 A267942 A147994 Adjacent sequences: A110895 A110896 A110897 * A110899 A110900 A110901 KEYWORD nonn,easy,less,uned 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 8 11:34 EDT 2023. Contains 363164 sequences. (Running on oeis4.)