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.

A385723 Numbers k such that m^m == m (mod k) where m = ceiling(k/2).

Table of values

n a(n)
1 1
2 2
3 6
4 7
5 10
6 14
7 17
8 18
9 22
10 23
11 26
12 30
13 31
14 34
15 38
16 41
17 42
18 46
19 47
20 50
21 54
22 58
23 62
24 66
25 70
26 71
27 73
28 74
29 78
30 79
31 82
32 86
33 89
34 90
35 94
36 97
37 98
38 102
39 103
40 106
41 110
42 113
43 114
44 118
45 122
46 126
47 127
48 130
49 134
50 137
51 138
52 142
53 146
54 150
55 151
56 154
57 158
58 162
59 166
60 167
61 170

List of values

[1, 2, 6, 7, 10, 14, 17, 18, 22, 23, 26, 30, 31, 34, 38, 41, 42, 46, 47, 50, 54, 58, 62, 66, 70, 71, 73, 74, 78, 79, 82, 86, 89, 90, 94, 97, 98, 102, 103, 106, 110, 113, 114, 118, 122, 126, 127, 130, 134, 137, 138, 142, 146, 150, 151, 154, 158, 162, 166, 167, 170]