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.

A117986 Number of functions f:[n]->[n] such that f[(x*y) mod n]=[f(x)*f(y)] mod n for all x,y in [n], for n=1,2,3,... Here [n] denotes {0,1,2,...,n-1}.

Table of values

n a(n)
1 1
2 3
3 4
4 6
5 6
6 35
7 8
8 50
9 20
10 55
11 12
12 160
13 14
14 75
15 160
16 194
17 18
18 195
19 20
20 256
21 220
22 115
23 24
24 3936
25 102
26 135
27 164
28 352
29 30
30 5301
31 32
32 770
33 340
34 175
35 352
36 2496
37 38
38 195
39 400
40 6396
41 42
42 7353
43 44
44 544
45 928
46 235
47 48
48 15456
49 296
50 1015
51 520
52 640
53 54
54 1635
55 544
56 8856

List of values

[1, 3, 4, 6, 6, 35, 8, 50, 20, 55, 12, 160, 14, 75, 160, 194, 18, 195, 20, 256, 220, 115, 24, 3936, 102, 135, 164, 352, 30, 5301, 32, 770, 340, 175, 352, 2496, 38, 195, 400, 6396, 42, 7353, 44, 544, 928, 235, 48, 15456, 296, 1015, 520, 640, 54, 1635, 544, 8856]