|
%I #9 Jul 09 2021 21:49:53
%S 0,1,0,1,1,2,0,1,1,2,0,1,2,1,0,1,1,2,1,2,2,3,0,1,1,1,2,3,1,2,0,1,1,2,
%T 0,1,2,1,0,1,2,3,2,1,2,3,0,1,1,1,1,2,1,2,0,1,2,3,0,1,2,1,0,1,1,2,1,2,
%U 1,2,0,1,1,1,2,2,1,2,0,1,1,2,0,1,2,3,2,3,1,1,2,2,3,2,0,1,1,1,1,2,1,2,1
%N a(n) = value of n defined as follows: start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by subtracting 1. The division steps are free, but subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2.
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a048/A048823.java">Java program</a> (github)
%Y Cf. A047988. Same formula except you cannot add 1 (only subtract).
%K nonn
%O 2,6
%A _Christian G. Bower_, May 15 1999
%E Missing a(2)=0 inserted by _Sean A. Irvine_, Jul 09 2021
|
