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.

A244798 Number of moduli m such that (prime(n) mod m) = 3.

Table of values

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

List of values

[0, 0, 0, 1, 2, 2, 2, 3, 4, 2, 4, 2, 2, 6, 4, 4, 6, 2, 5, 4, 6, 4, 8, 2, 2, 4, 7, 6, 2, 6, 4, 6, 2, 6, 2, 4, 6, 10, 4, 6, 8, 2, 4, 6, 2, 7, 8, 10, 10, 2, 6, 4, 6, 6, 2, 10, 6, 4, 2, 2, 14, 6, 8, 10, 6, 2, 6, 2, 6, 2, 10, 4, 10, 6, 6, 10, 2, 2, 2, 6, 10, 6, 4]

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

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