cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

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

List of values

[2, 24, 23, 21, 55, 64, 96, 96, 98, 109, 149, 149, 188, 186, 201, 197, 236, 232]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.