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.

A080218 Monotonically increasing sequence such that every positive integer n appears if and only if d(n) doesn't (d(n)=number of divisors of n, A000005).

Table of values

n a(n)
1 3
2 5
3 6
4 7
5 8
6 10
7 11
8 13
9 14
10 15
11 17
12 19
13 21
14 22
15 23
16 26
17 27
18 29
19 31
20 33
21 34
22 35
23 36
24 37
25 38
26 39
27 41
28 43
29 46
30 47
31 51
32 53
33 55
34 57
35 58
36 59
37 60
38 61
39 62
40 65
41 67
42 69
43 71
44 72
45 73
46 74
47 77
48 79
49 82
50 83
51 84
52 85
53 86
54 87
55 89
56 90
57 91
58 93
59 94
60 95
61 96
62 97
63 100
64 101
65 103
66 106
67 107
68 108
69 109

List of values

[3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 27, 29, 31, 33, 34, 35, 36, 37, 38, 39, 41, 43, 46, 47, 51, 53, 55, 57, 58, 59, 60, 61, 62, 65, 67, 69, 71, 72, 73, 74, 77, 79, 82, 83, 84, 85, 86, 87, 89, 90, 91, 93, 94, 95, 96, 97, 100, 101, 103, 106, 107, 108, 109]