A048825 Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding 1. The division steps are free, but adding 1 costs 1 point. a(n) is the smallest cost to reach 2.

0, 1, 0, 2, 1, 1, 0, 1, 2, 1, 0, 2, 1, 1, 0, 2, 1, 3, 2, 1, 1, 1, 0, 2, 2, 1, 1, 2, 1, 1, 0, 1, 2, 1, 0, 3, 2, 1, 0, 2, 1, 2, 1, 1, 1, 1, 0, 1, 2, 2, 2, 2, 1, 1, 0, 3, 2, 1, 0, 2, 1, 1, 0, 2, 1, 3, 2, 1, 1, 1, 0, 3, 2, 1, 2, 1, 1, 1, 0, 1, 2, 1, 0, 2, 2, 2, 1, 2, 1, 2, 1, 1, 1, 1, 0, 2, 1, 1, 2, 3, 2, 3, 2

Offset: 2

Author

Christian G. Bower, May 15 1999

Keywords

• nonn

Crossrefs

Cf. A047988. Same formula except you cannot subtract 1 (only add).

Extensions

Edited by Max Alekseyev, Jun 13 2011