login
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.
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,4
CROSSREFS
Cf. A047988. Same formula except you cannot subtract 1 (only add).
Sequence in context: A169590 A300185 A262804 * A339884 A116375 A301343
KEYWORD
nonn
AUTHOR
Christian G. Bower, May 15 1999
EXTENSIONS
Edited by Max Alekseyev, Jun 13 2011
STATUS
approved