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.

A096099 a(0) = 1, a(n) = least number such that the concatenation of all terms through a(n) is divisible by prime(n).

Table of values

n a(n)
0 1
1 2
2 3
3 5
4 5
5 2
6 13
7 25
8 8
9 22
10 16
11 26
12 35
13 35
14 11
15 26
16 48
17 58
18 6
19 46
20 4
21 77
22 83
23 29
24 33
25 187
26 61
27 78
28 81
29 23
30 183
31 15
32 22
33 68
34 8
35 137
36 84
37 178
38 99
39 7
40 71
41 82
42 142
43 241
44 133
45 71
46 56
47 19
48 32
49 318
50 157
51 199
52 303
53 16
54 201
55 201
56 213
57 257
58 355
59 229
60 365
61 379
62 345
63 27
64 52
65 19
66 272

List of values

[1, 2, 3, 5, 5, 2, 13, 25, 8, 22, 16, 26, 35, 35, 11, 26, 48, 58, 6, 46, 4, 77, 83, 29, 33, 187, 61, 78, 81, 23, 183, 15, 22, 68, 8, 137, 84, 178, 99, 7, 71, 82, 142, 241, 133, 71, 56, 19, 32, 318, 157, 199, 303, 16, 201, 201, 213, 257, 355, 229, 365, 379, 345, 27, 52, 19, 272]