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!)
 A175403 a(n) is the smallest number m requiring n iterations {((((D_1^D_2)^D_3)^D_4)^...)^D_k to reach a one-digit number starting at r = n, where D_k is the k-th digit D of the number r and k is the digit number of the number r in the decimal expansion of r (A055642)}. 6
 0, 10, 24, 26, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Conjecture: sequence is finite. Assuming that A020665(2) = 86, A020665(3) = 68, A020665(5) = 58 and A020665(7) = 35, a(4) is the last term; see A175402. LINKS EXAMPLE For n = 4: a(4) = 29 because 29 is the smallest number with 4 steps of defined iteration: {2^9 = 512}, {(5^1)^2 = 25}, {2^5 = 32}, {3^2 = 9}. CROSSREFS Cf. A020665, A175398, A175399, A175400, A175401, A175402, A175405. Sequence in context: A250583 A223415 A187629 * A133503 A175425 A076675 Adjacent sequences:  A175400 A175401 A175402 * A175404 A175405 A175406 KEYWORD nonn,base,more AUTHOR Jaroslav Krizek, May 01 2010 EXTENSIONS Comment and edits from Charles R Greathouse IV, Aug 03 2010 Further edits from N. J. A. Sloane, Aug 08 2010. I am still worried that n is mentioned too many times in the definition. 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.

Last modified August 2 18:52 EDT 2021. Contains 346428 sequences. (Running on oeis4.)