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.

A244797 Number of moduli m such that (prime(n) mod m) = 2.

Table of values

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

List of values

[0, 0, 1, 1, 2, 1, 3, 1, 3, 3, 1, 3, 3, 1, 5, 3, 3, 1, 3, 3, 1, 3, 4, 3, 3, 5, 1, 7, 1, 3, 3, 3, 7, 1, 5, 1, 3, 3, 7, 5, 3, 1, 7, 1, 7, 1, 3, 3, 8, 1, 7, 3, 1, 3, 7, 5, 3, 1, 5, 5, 1, 3, 3, 3, 1, 11, 3, 3, 7, 1, 7, 7, 3, 3, 3, 3, 5, 3, 7, 3, 3, 1, 7, 1, 3, 8]