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.

A346744 The number of congruences k^(n-k) + (n-k)^k == 0 (mod n) with 0 < k < n.

Table of values

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

List of values

[0, 1, 2, 3, 2, 3, 2, 5, 4, 7, 4, 7, 2, 3, 2, 9, 2, 7, 6, 7, 8, 3, 2, 15, 6, 9, 10, 11, 4, 17, 4, 17, 4, 9, 8, 15, 2, 5, 10, 15, 2, 13, 4, 11, 6, 3, 2, 19, 8, 15, 2, 11, 2, 19, 12, 19, 8, 11, 4, 19, 4, 5, 14, 33, 6, 13, 6, 17, 2, 25, 2, 31, 2, 9, 12, 11, 6, 29, 4]