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.

A060382 In base n, a(n) is the smallest number m that leads to a palindrome-free sequence, using the following process: start with m; reverse the digits and add it to m, repeat. Stop if you reach a palindrome.

Table of values

n a(n)
2 22
3 103
4 290
5 708
6 1079
7 2656
8 1021
9 593
10 196
11 1011
12 237
13 2701
14 361
15 447
16 413
17 3297
18 519
19 341
20 379
21 711
22 461
23 505
24 551
25 1022
26 649
27 701
28 755
29 811
30 869
31 929
32 991
33 1055
34 1799
35 1922
36 1259
37 1331
38 1405
39 1481
40 1559
41 1639
42 1595
43 1762
44 1891
45 1934
46 2069
47 2161

List of values

[22, 103, 290, 708, 1079, 2656, 1021, 593, 196, 1011, 237, 2701, 361, 447, 413, 3297, 519, 341, 379, 711, 461, 505, 551, 1022, 649, 701, 755, 811, 869, 929, 991, 1055, 1799, 1922, 1259, 1331, 1405, 1481, 1559, 1639, 1595, 1762, 1891, 1934, 2069, 2161]