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.

A180060 a(n) = 2^(2^n mod n) mod n.

Table of values

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

List of values

[0, 1, 1, 1, 4, 4, 4, 1, 4, 6, 4, 4, 4, 2, 1, 1, 4, 16, 4, 16, 4, 16, 4, 16, 3, 16, 13, 16, 4, 16, 4, 1, 25, 16, 29, 16, 4, 16, 22, 16, 4, 16, 4, 20, 32, 16, 4, 16, 22, 16, 1, 16, 4, 52, 8, 32, 28, 16, 4, 16, 4, 16, 4, 1, 61, 16, 4, 52, 49, 46, 4, 16, 4, 16, 31, 24, 36, 16, 4, 16]

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

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