Smallest positive number that requires n iterations of f(k) to reach a single digit, where f(k) is the product of the two numbers formed from the alternating digits of k.

A087473

Smallest positive number that requires n iterations of f(k) to reach a single digit, where f(k) is the product of the two numbers formed from the alternating digits of k.

Terms

    a(0) =1a(1) =10a(2) =25a(3) =39a(4) =77a(5) =171a(6) =199a(7) =577a(8) =887a(9) =1592a(10) =2682a(11) =3988a(12) =6913a(13) =18747a(14) =39577a(15) =58439a(16) =99428a(17) =173442a(18) =267343a(19) =299137a(20) =574182a(21) =685812a(22) =880543a(23) =1635812a(24) =1974447a(25) =2771717a(26) =18871813a(27) =45797337a(28) =49899368a(29) =58935768

External references