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.

A109891 Least number that requires n steps to reach 0 by repeated application of f: x -> abs(x - reverse(x)).

Table of values

n a(n)
0 0
1 1
2 10
3 16
4 14
5 15
6 13
7 1011
8 1017
9 1037
10 1027
11 1014
12 1013
13 1028
14 100143
15 100135
16 100145
17 100134
18 100103
19 100195
20 100137
21 100227
22 100114
23 100128
24 100194
25 100107
26 100307
27 100277
28 100413
29 100345
30 100429
31 100215
32 100444
33 100237
34 100433
35 100335

List of values

[0, 1, 10, 16, 14, 15, 13, 1011, 1017, 1037, 1027, 1014, 1013, 1028, 100143, 100135, 100145, 100134, 100103, 100195, 100137, 100227, 100114, 100128, 100194, 100107, 100307, 100277, 100413, 100345, 100429, 100215, 100444, 100237, 100433, 100335]

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

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