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.

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

Table of values

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

List of values

[1, 2, 1, 3, 2, 3, 3, 7, 5, 5, 5, 7, 6, 7, 7, 14, 8, 11, 9, 11, 10, 11, 11, 15, 14, 13, 17, 15, 14, 15, 15, 30, 16, 17, 17, 23, 18, 19, 19, 23, 20, 21, 21, 23, 23, 23, 23, 31, 27, 29, 25, 27, 26, 35, 27, 31, 28, 29, 29, 31, 30, 31, 32, 62, 32, 33, 33, 35, 34, 35, 35, 47]