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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110897 Let fw[n_] := Mod[n, 3], fb[n_] := Mod[n, 2]; a(n) = a(n-a(n-1))+1+fw[n-a(n-2)]-fb[n-a(n-1)]. 1

%I #6 Dec 18 2022 02:33:25

%S 0,1,3,3,2,5,2,7,1,4,3,3,4,5,5,5,5,5,6,7,7,8,6,5,7,9,6,8,9,8,7,10,8,

%T 11,7,10,9,10,12,10,9,10,9,8,12,12,9,15,11,14,10,11,10,8,12,10,12,14,

%U 14,12,13,13,15,14,12,8,15,13,12,16,14,15,15,16,17,17,14,14,14,10,15,18,14,18

%N Let fw[n_] := Mod[n, 3], fb[n_] := Mod[n, 2]; a(n) = a(n-a(n-1))+1+fw[n-a(n-2)]-fb[n-a(n-1)].

%t fw[n_] := Mod[n, 3]

%t fb[n_] := Mod[n, 2]

%t f[0] = 0; f[1] = 1;

%t f[n_] := f[n] = f[n - f[n - 1]] + 1 + fw[n - f[n - 2]] - fb[n - f[n - 1]]

%t Table[f[n], {n, 0, 200}]

%K nonn,easy,less,uned

%O 0,3

%A _Roger L. Bagula_, Sep 20 2005

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 September 29 23:18 EDT 2023. Contains 365781 sequences. (Running on oeis4.)