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.

A380816 Number of pairs (x, y) with 0 < x < y < n such that x^y = y^x modulo n.

Table of values

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

List of values

[0, 0, 0, 0, 1, 1, 5, 2, 2, 3, 5, 6, 8, 8, 6, 18, 11, 7, 20, 16, 15, 17, 28, 28, 15, 23, 32, 27, 24, 22, 35, 88, 20, 31, 19, 34, 32, 43, 35, 72, 33, 40, 37, 52, 45, 51, 57, 134, 36, 37, 38, 73, 65, 73, 61, 118, 72, 52, 59, 94, 61, 74, 111, 428, 67, 65, 69]

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

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