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.

A380858 a(n) is the number of primes p <= n such that p^(p + n) == p (mod p + n).

Table of values

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

List of values

[0, 0, 2, 1, 2, 1, 1, 2, 1, 3, 2, 3, 1, 3, 2, 3, 2, 4, 1, 3, 1, 3, 1, 6, 0, 6, 1, 4, 2, 7, 1, 3, 0, 6, 3, 6, 1, 5, 2, 5, 2, 8, 1, 5, 1, 5, 1, 8, 0, 6, 2, 5, 1, 9, 0, 8, 1, 5, 3, 12, 1, 8, 1, 7, 2, 11, 1, 8, 2, 8, 2, 10, 1, 6, 0, 9, 1, 12, 1, 7, 1, 5, 1, 13, 0, 9, 3, 6, 1, 15]