A072218 - cp's OEIS frontend

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.

n	a(n)
1	11
2	8813200023188
3	8813200023188
4	8813200023188
5	4668731596684224866951378664
6	682049569465550121055564965940286
7	555458774083726674580862268085476627380477854555
8	555458774083726674580862268085476627380477854555
9	1345428953367763125675365555635765213677633598245431

[11, 8813200023188, 8813200023188, 8813200023188, 4668731596684224866951378664, 682049569465550121055564965940286, 555458774083726674580862268085476627380477854555, 555458774083726674580862268085476627380477854555, 1345428953367763125675365555635765213677633598245431]

cp's OEIS Frontend

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.

Table of values

List of values