|
%I #20 Sep 10 2019 21:50:48
%S 1,2,2,3,2,4,2,4,3,5,2,5,2,5,3,5,2,7,2,6,4,6,2,6,3,6,4,6,2,7,2,6,3,8,
%T 3,8,2,7,5,7,2,9,2,7,5,7,2,7,3,10,3,7,2,11,5,7,5,8,2,8,2,7,5,7,3,8,2,
%U 9,4,8,2,9,2,8,5,8,3,12,2,8,5,10,2,10,5,8,3,8,2,10,3,8,5,8,3,8,2,9,6,11,2,9,2,8,6
%N Number of positive integers that are reachable from n with some combination of transitions x -> x-phi(x) and x -> gcd(x,phi(x)).
%H Antti Karttunen, <a href="/A326198/b326198.txt">Table of n, a(n) for n = 1..16384</a>
%H Antti Karttunen, <a href="/A326198/a326198.txt">Data supplement: n, a(n) computed for n = 1..100000</a>
%F a(n) > max(A071575(n), A326195(n)).
%e From n = 12 we can reach any of the following numbers > 0: 12 (with an empty sequence of transitions), 8 (as A051953(12) = 8), 4 (as A009195(12) = A009195(8) = A051953(8) = 4), 2 (as A009195(4) = A051953(4) = 2) and 1 (as A009195(2) = A051953(2) = 1), thus a(12) = 5.
%e The directed acyclic graph formed from those two transitions with 12 as its unique root looks like this:
%e 12
%e / \
%e | 8
%e \ /
%e 4
%e |
%e 2
%e |
%e 1
%o (PARI)
%o A326198aux(n,xs) = if(vecsearch(xs,n),xs, xs = setunion([n],xs); if(1==n,xs, my(a=gcd(n,eulerphi(n)), b=n-eulerphi(n)); xs = A326198aux(a,xs); if((a==b),xs, A326198aux(b,xs))));
%o A326198(n) = length(A326198aux(n,Set([])));
%Y Cf. A000010, A009195, A051953, A071575, A300243, A326195.
%Y Cf. also A326189, A326196, A327160, A327161.
%K nonn
%O 1,2
%A _Antti Karttunen_, Aug 24 2019
|
