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.

A117987 Number of functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)] 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 2
3 3
4 8
5 5
6 24
7 49
8 128
9 27
10 160
11 11
12 1536
13 13
14 6272
15 10125
16 32768
17 289
18 13824
19 19
20 163840
21 64827
22 22528
23 529
24 6291456
25 125
26 106496
27 729
28 102760448
29 29
30 331776000
31 887503681
32 2147483648
33 107811
34 37879808
35 300125
36 3623878656
37 37
38 9961472

List of values

[1, 2, 3, 8, 5, 24, 49, 128, 27, 160, 11, 1536, 13, 6272, 10125, 32768, 289, 13824, 19, 163840, 64827, 22528, 529, 6291456, 125, 106496, 729, 102760448, 29, 331776000, 887503681, 2147483648, 107811, 37879808, 300125, 3623878656, 37, 9961472]