OFFSET
1,1
COMMENTS
if the sequence of iterates hits an odd square, then the succeeding f(n) is even. The iterates will remain even until f(n) is an even square, so the sequence grows slowly for a long time, then has big 'jumps'. Is the sequence infinite?
LINKS
Robert Israel, Table of n, a(n) for n = 1..4453
EXAMPLE
If f(n) = n + tau(n), then the functional iterates of 7 are 7,9,12,18,24,32,38,42,50,56,64 and 71 which is prime so a(2)=7, a(3)=71
MAPLE
a:= 1: R:= NULL: count:= 0:
while count < 100 do
a:= a+numtheory:-tau(a);
if isprime(a) then count:= count+1; R:= R, a; fi
od:
R; # Robert Israel, Nov 14 2020
MATHEMATICA
Select[NestList[#+DivisorSigma[0, #]&, 1, 2535] , PrimeQ] (* James C. McMahon, Jul 07 2024 *)
CROSSREFS
KEYWORD
nonn,look
AUTHOR
John L. Drost, Jan 25 2006
STATUS
approved