Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives number of steps N takes to converge.

A072217

Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives number of steps N takes to converge.

Terms

    a(0) =2a(1) =24a(2) =23a(3) =21a(4) =55a(5) =64a(6) =96a(7) =96a(8) =98a(9) =109a(10) =149a(11) =149a(12) =188a(13) =186a(14) =201a(15) =197a(16) =236a(17) =232

External references