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

 

Logo


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
0, 10, 24, 27, 33 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

Table of n, a(n) for n=0..4.

FORMULA

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

EXAMPLE

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.

CROSSREFS

Cf. A175419 - A175427.

Sequence in context: A187629 A175403 A133503 * A076675 A063925 A101156

Adjacent sequences:  A175422 A175423 A175424 * A175426 A175427 A175428

KEYWORD

nonn,base

AUTHOR

Jaroslav Krizek, May 09 2010

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 June 16 19:49 EDT 2021. Contains 345068 sequences. (Running on oeis4.)