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.

A386409 Number of nonnegative values s < n such that (-s)^s == -s (mod n).

Table of values

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

List of values

[1, 1, 2, 2, 2, 4, 2, 4, 3, 4, 3, 7, 5, 5, 6, 6, 4, 6, 4, 9, 8, 5, 2, 13, 4, 8, 3, 9, 4, 14, 3, 6, 7, 8, 12, 11, 3, 7, 10, 17, 5, 16, 6, 9, 10, 5, 2, 19, 7, 8, 10, 13, 3, 6, 11, 18, 11, 7, 3, 27, 5, 7, 14, 10, 16, 17, 5, 13, 7, 21, 4, 21, 5, 6, 14, 12, 12, 21, 5, 27, 6, 11, 3, 29, 16, 10, 9, 19, 4, 23]