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.

A082371 Indices n such that the congruence prime(n)^x + prime(n+1)^x == prime(n+2) mod prime(n+3) has no solution.

Table of values

n a(n)
1 2
2 7
3 9
4 11
5 16
6 19
7 20
8 22
9 23
10 25
11 28
12 29
13 30
14 31
15 32
16 33
17 35
18 36
19 37
20 39
21 40
22 41
23 45
24 46
25 49
26 52
27 54
28 56
29 62
30 64
31 66
32 68
33 69
34 70
35 79
36 80
37 81
38 82
39 83
40 85
41 88
42 91
43 96
44 98
45 102
46 103
47 108
48 110
49 114
50 116
51 117
52 118
53 119
54 122
55 123
56 126
57 131
58 136
59 143
60 144
61 148
62 150
63 154

List of values

[2, 7, 9, 11, 16, 19, 20, 22, 23, 25, 28, 29, 30, 31, 32, 33, 35, 36, 37, 39, 40, 41, 45, 46, 49, 52, 54, 56, 62, 64, 66, 68, 69, 70, 79, 80, 81, 82, 83, 85, 88, 91, 96, 98, 102, 103, 108, 110, 114, 116, 117, 118, 119, 122, 123, 126, 131, 136, 143, 144, 148, 150, 154]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.