|
%I #6 Jan 10 2017 19:12:27
%S 1,2,1,1,1,6,1,1,9,2,1,2,1,2,3,1,1,3,1,20,3,2,1,2,1,2,1,4,1,30,1,1,3,
%T 2,1,3,1,2,3,4,1,6,1,4,5,2,1,2,1,5,3,4,1,1,1,56,3,2,1,6,1,2,1,1,1,6,1,
%U 4,3,10,1,3,1,2,75,4,1,6,1,4,1,2,1,84,1,2,3,8,1,10,1,4,3,2,1,2,1,1,1,1,1,6,1,8,15,2,1,1,1,10,3,8,1,6,1,4,1,2
%N a(n) = gcd(n,A122111(n)).
%H Antti Karttunen, <a href="/A280491/b280491.txt">Table of n, a(n) for n = 1..8192</a>
%F a(n) = gcd(n,A122111(n)).
%F a(n) = n / A280490(n).
%F Other identities. For all n >= 1:
%F a(A122111(n)) = a(n).
%o (Scheme) (definec (A280491 n) (gcd n (A122111 n)))
%Y Cf. A122111, A280490, also A280489.
%Y Cf. A088902 (the fixed points, n for which a(n) = n).
%K nonn
%O 1,2
%A _Antti Karttunen_, Jan 09 2017
|
