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.

A250747 Start with a(0) = 0; then a(n) = smallest number not already in the sequence 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 6
7 9
8 13
9 26
10 15
11 18
12 30
13 431
14 73
15 67
16 134
17 7
18 14
19 21
20 35
21 29
22 58
23 127
24 27
25 39
26 43
27 70
28 11
29 22
30 19
31 38
32 95
33 190
34 2748070932534311
35 2768821759897
36 5537643519794
37 787
38 191
39 382
40 955
41 17
42 31
43 45
44 54
45 90
46 101
47 202
48 303
49 57
50 114
51 47
52 55
53 33
54 66

List of values

[0, 1, 2, 3, 5, 10, 6, 9, 13, 26, 15, 18, 30, 431, 73, 67, 134, 7, 14, 21, 35, 29, 58, 127, 27, 39, 43, 70, 11, 22, 19, 38, 95, 190, 2748070932534311, 2768821759897, 5537643519794, 787, 191, 382, 955, 17, 31, 45, 54, 90, 101, 202, 303, 57, 114, 47, 55, 33, 66]