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.

A250745 Start with a(1) = 1; then a(n) = smallest number, not already in the sequence, such that a(n) divides concat(a(1), a(2), ..., a(n)).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 10
6 4
7 8
8 6
9 11
10 20
11 13
12 7
13 9
14 12
15 15
16 18
17 14
18 25
19 30
20 24
21 16
22 32
23 40
24 29
25 50
26 100
27 26
28 52
29 39
30 21
31 28
32 35
33 42
34 17
35 34
36 51
37 23
38 46
39 27
40 36
41 45
42 43
43 19
44 38
45 68
46 48
47 60
48 75
49 90
50 54
51 56
52 58
53 22
54 44
55 33
56 55
57 97
58 125
59 200
60 64
61 80
62 69
63 66
64 88
65 70
66 41
67 82

List of values

[1, 2, 3, 5, 10, 4, 8, 6, 11, 20, 13, 7, 9, 12, 15, 18, 14, 25, 30, 24, 16, 32, 40, 29, 50, 100, 26, 52, 39, 21, 28, 35, 42, 17, 34, 51, 23, 46, 27, 36, 45, 43, 19, 38, 68, 48, 60, 75, 90, 54, 56, 58, 22, 44, 33, 55, 97, 125, 200, 64, 80, 69, 66, 88, 70, 41, 82]