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.

A220295 Least prime q satisfying q^p == 1 (mod 2p+1) and p^q == 1 (mod 2q+1), or 0 if otherwise, where p = prime(n).

Table of values

n a(n)
1 11
2 11
3 5
4 0
5 2
6 0
7 281
8 0
9 3
10 3
11 0
12 0
13 11
14 0
15 761
16 3
17 15233
18 0
19 0
20 2003
21 0
22 0
23 89
24 5
25 0
26 11369
27 0
28 431
29 0
30 3
31 0
32 2
33 15401
34 0
35 2393
36 0
37 0
38 0
39 14741
40 11
41 2
42 0
43 2
44 0
45 7901
46 0
47 0
48 0
49 11831
50 0
51 3
52 2
53 0
54 2
55 7211
56 235043
57 10781
58 0
59 0
60 3
61 0
62 29
63 0
64 31151
65 0
66 77471
67 0

List of values

[11, 11, 5, 0, 2, 0, 281, 0, 3, 3, 0, 0, 11, 0, 761, 3, 15233, 0, 0, 2003, 0, 0, 89, 5, 0, 11369, 0, 431, 0, 3, 0, 2, 15401, 0, 2393, 0, 0, 0, 14741, 11, 2, 0, 2, 0, 7901, 0, 0, 0, 11831, 0, 3, 2, 0, 2, 7211, 235043, 10781, 0, 0, 3, 0, 29, 0, 31151, 0, 77471, 0]