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.

A239063 Numbers k for which the equation x^x == 1 (mod k) has x=1 as its only solution such that 1 <= x <= k.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 8
6 10
7 12
8 16
9 18
10 20
11 24
12 30
13 32
14 34
15 36
16 40
17 42
18 46
19 48
20 50
21 54
22 60
23 64
24 68
25 72
26 78
27 80
28 82
29 84
30 90
31 94
32 96
33 98
34 100
35 102
36 108
37 110
38 114
39 120
40 126
41 128
42 136
43 144
44 150
45 156
46 160
47 162
48 164
49 168
50 170
51 176
52 180
53 186
54 188
55 192
56 194
57 198
58 200
59 204

List of values

[1, 2, 4, 6, 8, 10, 12, 16, 18, 20, 24, 30, 32, 34, 36, 40, 42, 46, 48, 50, 54, 60, 64, 68, 72, 78, 80, 82, 84, 90, 94, 96, 98, 100, 102, 108, 110, 114, 120, 126, 128, 136, 144, 150, 156, 160, 162, 164, 168, 170, 176, 180, 186, 188, 192, 194, 198, 200, 204]

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

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