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.

A155886 Least k such that 2^(2^k) = n (mod k).

Table of values

n a(n)
0 1
1 3
2 14
3 11
4 6
5 1941491
6 10
7 83
8 31
9 13
10 123
11 35
12 71
13 27
14 34913
15 241
16 18
17 8059
18 34
19 349
20 44
21 25
22 39
23 100867561
24 76
25 231
26 253
27 66203
28 57
29 227
30 139
31 45
32 184
33 37
34 111
35 97
36 55
37 41
38 103
39 1099
40 81
41 66791
42 53

List of values

[1, 3, 14, 11, 6, 1941491, 10, 83, 31, 13, 123, 35, 71, 27, 34913, 241, 18, 8059, 34, 349, 44, 25, 39, 100867561, 76, 231, 253, 66203, 57, 227, 139, 45, 184, 37, 111, 97, 55, 41, 103, 1099, 81, 66791, 53]