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.

A162002 Numbers n for which 2^^n == 2^2^n (mod n); for the "^^" notation see A092188.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 8
8 10
9 12
10 14
11 15
12 16
13 17
14 18
15 20
16 24
17 26
18 28
19 30
20 32
21 34
22 36
23 40
24 42
25 43
26 44
27 46
28 48
29 51
30 52
31 56
32 58
33 60
34 64
35 68
36 70
37 72
38 76
39 78
40 80
41 84
42 85
43 88
44 90
45 96
46 100
47 102
48 104
49 112
50 120
51 124
52 126
53 127
54 128
55 130
56 132
57 136
58 140
59 141
60 144
61 145
62 148
63 156
64 160
65 164

List of values

[1, 2, 3, 4, 5, 6, 8, 10, 12, 14, 15, 16, 17, 18, 20, 24, 26, 28, 30, 32, 34, 36, 40, 42, 43, 44, 46, 48, 51, 52, 56, 58, 60, 64, 68, 70, 72, 76, 78, 80, 84, 85, 88, 90, 96, 100, 102, 104, 112, 120, 124, 126, 127, 128, 130, 132, 136, 140, 141, 144, 145, 148, 156, 160, 164]