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.

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

Table of values

n a(n)
1 1
2 4
3 6
4 16
5 18
6 576
7 78
8 1728
9 1365
10 5184
11 486
12 2985984
13 3474
14 389376
15 13583700
16 268435456
17 65538
18 119246400
19 45006
20 39261044736
21 21400013700
22 15116544
23 67590
24 45476068117708800
25 8696104065
26 772395264
27 19496328075
28 1822309056774144
29 231340050

List of values

[1, 4, 6, 16, 18, 576, 78, 1728, 1365, 5184, 486, 2985984, 3474, 389376, 13583700, 268435456, 65538, 119246400, 45006, 39261044736, 21400013700, 15116544, 67590, 45476068117708800, 8696104065, 772395264, 19496328075, 1822309056774144, 231340050]