cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 10, 24, 27, 33
Offset: 0

Views

Author

Jaroslav Krizek, May 09 2010

Keywords

Comments

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

Examples

			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

Formula

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