A072216 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A072216

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 values of N.

5, 89, 187, 1297, 10911, 150296, 9008299, 15002893, 140669390, 1005499526, 10087799570

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Since we do not even know if 196 eventually converges (see A006960, A023108) for n >= 3 these values are only conjectures.

LINKS

Table of n, a(n) for n=1..11.

Jason Doucette, World records

Index entries for sequences related to Reverse and Add!

CROSSREFS

Cf. A072217, A072218, A001127, A006960, A023108.