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.

A381167 Each term is the least positive integer not appearing earlier such that gcd(a(m),a(n)) = 1 or |m-n| > max(a(m),a(n)) for all m <> n.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 11
7 4
8 13
9 17
10 19
11 23
12 29
13 9
14 31
15 37
16 8
17 41
18 43
19 47
20 53
21 59
22 61
23 67
24 71
25 6
26 73
27 79
28 83
29 89
30 25
31 97
32 101
33 103
34 107
35 109
36 113
37 127
38 12
39 131
40 137
41 139
42 149
43 151
44 157
45 163
46 167
47 173
48 179
49 181
50 191
51 193
52 197
53 14
54 199
55 211
56 15
57 223
58 227
59 229
60 233
61 239
62 241
63 251
64 257
65 263
66 269
67 271
68 277

List of values

[1, 2, 3, 5, 7, 11, 4, 13, 17, 19, 23, 29, 9, 31, 37, 8, 41, 43, 47, 53, 59, 61, 67, 71, 6, 73, 79, 83, 89, 25, 97, 101, 103, 107, 109, 113, 127, 12, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 14, 199, 211, 15, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277]