The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175425 The smallest number m which needs n iterations of the map x->A175420(x) to reach a single-digit number. 6

%I

%S 0,10,24,27,33

%N The smallest number m which needs n iterations of the map x->A175420(x) to reach a single-digit number.

%C Conjecture: sequence a(n) is finite for n = natural number, a(n) = 25 for n = infinity. See A175424.

%F a(n) = min {j : A175425(j) = n}.

%e a(4) = 33 because 33 is the smallest numbers with 4 steps of defined iteration: 3^3 = 27, 7^2 = 49, 9^4 = 6561, ((1^6)^5)^6 = 1.

%Y Cf. A175419 - A175427.

%K nonn,base

%O 0,2

%A _Jaroslav Krizek_, May 09 2010

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.

Last modified July 31 13:25 EDT 2021. Contains 346373 sequences. (Running on oeis4.)