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.

A282028 If n is prime then a(n) = 2n, otherwise a(n) is the smallest missing number.

Table of values

n a(n)
0 0
1 1
2 4
3 6
4 2
5 10
6 3
7 14
8 5
9 7
10 8
11 22
12 9
13 26
14 11
15 12
16 13
17 34
18 15
19 38
20 16
21 17
22 18
23 46
24 19
25 20
26 21
27 23
28 24
29 58
30 25
31 62
32 27
33 28
34 29
35 30
36 31
37 74
38 32
39 33
40 35
41 82
42 36
43 86
44 37
45 39
46 40
47 94
48 41
49 42
50 43
51 44
52 45
53 106
54 47
55 48
56 49
57 50
58 51
59 118
60 52
61 122
62 53
63 54
64 55
65 56
66 57
67 134
68 59
69 60
70 61
71 142
72 63
73 146
74 64
75 65

List of values

[0, 1, 4, 6, 2, 10, 3, 14, 5, 7, 8, 22, 9, 26, 11, 12, 13, 34, 15, 38, 16, 17, 18, 46, 19, 20, 21, 23, 24, 58, 25, 62, 27, 28, 29, 30, 31, 74, 32, 33, 35, 82, 36, 86, 37, 39, 40, 94, 41, 42, 43, 44, 45, 106, 47, 48, 49, 50, 51, 118, 52, 122, 53, 54, 55, 56, 57, 134, 59, 60, 61, 142, 63, 146, 64, 65]