Adaptive algorithms are capable of modifying their own behavior through time, depending on the execution characteristics. Recently, we proposed the LRU-WAR, an adaptive page replacement algorithm whose target is to minimize failures detected in LRU policy, preserving its simplicity. In this paper, we present a new online approach inspired by the LRU-WAR: the 3P adaptive algorithm. By detecting sequential accesses in an effective way, the new algorithm combines the high performance of LRU-WAR with the low overhead inherent in the Clock algorithm. The performance gain from Clock to 3P has achieved 69% in simulation experiments.