|
%I #19 May 13 2019 14:01:25
%S 1,2,3,4,12,6,12,12,12,12,18,12,28,14,15,16,72,18,72,20,28,22,36,24,
%T 42,28,72,28,72,30,72,72,42,72,72,36,252,72,72,72,90,42,252,44,72,46,
%U 72,72,252,50,252,72,252,72,90,72,252,72,90,72,168,72,252,252,168,66,168,252
%N Function A062402(x) = sigma(phi(x)) is iterated. Starting with n, a(n) is the largest term arising in trajectory, either in transient or in terminal cycle.
%H Antti Karttunen, <a href="/A096864/b096864.txt">Table of n, a(n) for n = 1..16384</a>
%F a(n) = max(n, A066437(n)). - _Antti Karttunen_, Dec 06 2017
%e n=256: list={256,255,255}, a(256)=256 as a transient term;
%e n=101: list={101,217,546,403,1170,819,[1240,1512],1240,...}, a(101)=1512 as a cycle term.
%t gf[x_] :=DivisorSigma[1, EulerPhi[x]] gite[x_, hos_] :=NestList[gf, x, hos] Table[Max[gite[w, 20]], {w, 1, 256}]
%t Table[Max[NestList[DivisorSigma[1,EulerPhi[#]]&,n,20]],{n,70}] (* _Harvey P. Dale_, May 13 2019 *)
%o (Scheme) (define (A096864 n) (let loop ((visited (list n)) (m n)) (let ((next (A062402 (car visited)))) (cond ((member next visited) m) (else (loop (cons next visited) (max m next))))))) ;; _Antti Karttunen_, Nov 18 2017
%Y Cf. A062401, A062402, A066437, A096862, A096863, A096866 (smallest term), A096993.
%Y Cf. also A096861.
%K nonn,look
%O 1,2
%A _Labos Elemer_, Jul 21 2004
|
