|
%I #6 Dec 05 2013 19:55:59
%S 1,2,1,1,1,11,11,10,10,10,1,9,2,9,1,10,1,8,10,8,9,8,9,7,8,7,1,7,1,6,2,
%T 6,1,6,2,4,2,5,1,95,1,4,4,4,3,4,96,94,95,3,2,94,2,93,1,2,1,93,1,9,3,
%U 92,2,1,2,91,2,91,1,90,1,8,91,90,90,90,90,89,90,88,89,89,2,7,1,88,5,7,5,87,4
%N Define f(n)= n + tau(n), then a(n) = k where k is the number of steps required to get the smallest prime of the form f(f(f...f(n)))).
%e a(6) = 11 as f(6) = 10, f(10) = 14, f(14) = 18, f(18) = 24, f(24) = 32, f(32) = 38, f(38) = 42, f(42) = 50, f(50) = 56, f(56) = 64, f(64) = 64 +7 = 71.
%o (PARI) { a(n) = local(k,m); k=1; m=n; while(1, m=m+numdiv(m); if(isprime(m),return(k)); k++ ) } (Alekseyev)
%Y Cf. A079833.
%K nonn
%O 1,2
%A _Amarnath Murthy_, Feb 12 2003
%E More terms from _Max Alekseyev_, Apr 19 2005
|
