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.

A140180 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 5
4 10
5 11
6 13
7 16
8 22
9 23
10 25
11 26
12 28
13 29
14 33
15 35
16 36
17 39
18 40
19 41
20 43
21 46
22 50
23 52
24 53
25 56
26 58
27 61
28 63
29 65
30 66
31 67
32 70
33 73
34 78
35 81
36 82
37 83
38 86
39 88
40 89
41 92
42 93
43 95
44 96
45 100
46 101
47 105
48 106
49 111
50 112
51 113
52 116
53 119
54 122
55 124
56 125
57 126
58 127
59 130
60 131
61 134
62 136
63 145

List of values

[1, 2, 5, 10, 11, 13, 16, 22, 23, 25, 26, 28, 29, 33, 35, 36, 39, 40, 41, 43, 46, 50, 52, 53, 56, 58, 61, 63, 65, 66, 67, 70, 73, 78, 81, 82, 83, 86, 88, 89, 92, 93, 95, 96, 100, 101, 105, 106, 111, 112, 113, 116, 119, 122, 124, 125, 126, 127, 130, 131, 134, 136, 145]