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.

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

Table of values

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

List of values

[1, 2, 2, 2, 3, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 8, 9, 12, 10, 10, 11, 12, 12, 12, 15, 14, 18, 14, 15, 16, 16, 16, 17, 18, 18, 18, 19, 20, 20, 20, 21, 22, 22, 22, 24, 24, 24, 24, 28, 30, 26, 26, 27, 36, 28, 28, 29, 30, 30, 30, 31, 32, 33, 32, 33, 34, 34, 34, 35]

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

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