login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326198 Number of positive integers that are reachable from n with some combination of transitions x -> x-phi(x) and x -> gcd(x,phi(x)). 4
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..16384

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..100000

FORMULA

a(n) > max(A071575(n), A326195(n)).

EXAMPLE

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.

The directed acyclic graph formed from those two transitions with 12 as its unique root looks like this:

    12

    / \

   |   8

    \ /

     4

     |

     2

     |

     1

PROG

(PARI)

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))));

A326198(n) = length(A326198aux(n, Set([])));

CROSSREFS

Cf. A000010, A009195, A051953, A071575, A300243, A326195.

Cf. also A326189, A326196, A327160, A327161.

Sequence in context: A086292 A335708 A076640 * A324105 A328871 A169819

Adjacent sequences:  A326195 A326196 A326197 * A326199 A326200 A326201

KEYWORD

nonn

AUTHOR

Antti Karttunen, Aug 24 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 09:38 EST 2020. Contains 338639 sequences. (Running on oeis4.)