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.

A140181 A number n is included if the smallest prime that is congruent to 1 (mod n) is >= the smallest prime that is congruent to -1 (mod n).

Table of values

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

List of values

[1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 15, 17, 18, 19, 20, 21, 24, 27, 30, 31, 32, 34, 37, 38, 42, 44, 45, 47, 48, 49, 51, 54, 55, 57, 59, 60, 62, 64, 68, 69, 71, 72, 74, 75, 76, 77, 79, 80, 84, 85, 87, 90, 91, 94, 97, 98, 99, 102, 103, 104, 107, 108, 109, 110, 114, 115, 117]