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.

A250746 Start with a(0) = 0; then a(n) = smallest number > a(n-1) such that a(n) divides concat(a(n), a(n-1), ..., a(0)).

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 5
5 10
6 15
7 18
8 19
9 35
10 42
11 51
12 55
13 70
14 85
15 93
16 95
17 106
18 155
19 217
20 310
21 745
22 1210
23 1342
24 3355
25 5185
26 6222
27 6330
28 9495
29 10413
30 11115
31 12070
32 13774
33 34435
34 41322
35 61983
36 68870
37 1601065116264571
38 2217993924228622
39 2324778503347862
40 2325380783693255

List of values

[0, 1, 2, 3, 5, 10, 15, 18, 19, 35, 42, 51, 55, 70, 85, 93, 95, 106, 155, 217, 310, 745, 1210, 1342, 3355, 5185, 6222, 6330, 9495, 10413, 11115, 12070, 13774, 34435, 41322, 61983, 68870, 1601065116264571, 2217993924228622, 2324778503347862, 2325380783693255]