|
|
A072218
|
|
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 palindrome that is reached.
|
|
11
|
|
|
11, 8813200023188, 8813200023188, 8813200023188, 4668731596684224866951378664, 682049569465550121055564965940286, 555458774083726674580862268085476627380477854555, 555458774083726674580862268085476627380477854555, 1345428953367763125675365555635765213677633598245431
(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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|