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.

A171785 Start with a(1) = 1; then a(n) = smallest number > a(n-1) 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 12
7 15
8 20
9 25
10 30
11 39
12 44
13 50
14 100
15 101
16 125
17 150
18 188
19 200
20 220
21 230
22 250
23 272
24 304
25 320
26 370
27 376
28 400
29 500
30 525
31 600
32 615
33 625
34 1000
35 1250
36 1487
37 1500
38 1590
39 1696
40 1750
41 2000
42 2245
43 2500
44 3000
45 3090
46 3125
47 3800
48 4000
49 5000
50 5725
51 6122
52 7025

List of values

[1, 2, 3, 5, 10, 12, 15, 20, 25, 30, 39, 44, 50, 100, 101, 125, 150, 188, 200, 220, 230, 250, 272, 304, 320, 370, 376, 400, 500, 525, 600, 615, 625, 1000, 1250, 1487, 1500, 1590, 1696, 1750, 2000, 2245, 2500, 3000, 3090, 3125, 3800, 4000, 5000, 5725, 6122, 7025]