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.

A184997 Number of distinct remainders that are possible when a safe prime p is divided by n (for p > 2*n+1).

Table of values

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

List of values

[1, 1, 1, 1, 3, 1, 5, 2, 3, 3, 9, 1, 11, 5, 3, 4, 15, 3, 17, 3, 5, 9, 21, 2, 15, 11, 9, 5, 27, 3, 29, 8, 9, 15, 15, 3, 35, 17, 11, 6, 39, 5, 41, 9, 9, 21, 45, 4, 35, 15, 15, 11, 51, 9, 27, 10, 17, 27, 57, 3, 59, 29, 15, 16, 33, 9, 65, 15, 21, 15, 69, 6, 71, 35, 15, 17, 45, 11, 77, 12]