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.

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

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 10
6 20
7 8
8 16
9 25
10 50
11 40
12 32
13 64
14 80
15 100
16 125
17 200
18 160
19 128
20 250
21 400
22 320
23 256
24 500
25 625
26 1000
27 800
28 640
29 512
30 1024
31 1250
32 2000
33 1280
34 1600
35 2500
36 3125
37 5000
38 3200
39 2048
40 2560
41 4000
42 6250
43 10000
44 6400
45 4096
46 5120
47 8000
48 10240
49 8192
50 12500
51 15625

List of values

[1, 2, 4, 5, 10, 20, 8, 16, 25, 50, 40, 32, 64, 80, 100, 125, 200, 160, 128, 250, 400, 320, 256, 500, 625, 1000, 800, 640, 512, 1024, 1250, 2000, 1280, 1600, 2500, 3125, 5000, 3200, 2048, 2560, 4000, 6250, 10000, 6400, 4096, 5120, 8000, 10240, 8192, 12500, 15625]