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.

A321904 Irregular table read by rows: T(n,k) is the smallest m such that m^(-m) == 2*k + 1 (mod 2^n), 0 <= k <= 2^(n-1) - 1.

Table of values

n a(n)
1 1
2 1
3 3
4 1
5 3
6 5
7 7
8 1
9 3
10 13
11 7
12 9
13 11
14 5
15 15
16 1
17 19
18 29
19 7
20 25
21 27
22 21
23 15
24 17
25 3
26 13
27 23
28 9
29 11
30 5
31 31
32 1
33 51
34 29
35 7
36 57
37 59
38 21
39 15
40 49
41 3
42 13
43 23
44 41
45 11
46 5
47 31
48 33
49 19
50 61
51 39
52 25
53 27
54 53
55 47
56 17
57 35
58 45
59 55
60 9
61 43
62 37
63 63

List of values

[1, 1, 3, 1, 3, 5, 7, 1, 3, 13, 7, 9, 11, 5, 15, 1, 19, 29, 7, 25, 27, 21, 15, 17, 3, 13, 23, 9, 11, 5, 31, 1, 51, 29, 7, 57, 59, 21, 15, 49, 3, 13, 23, 41, 11, 5, 31, 33, 19, 61, 39, 25, 27, 53, 47, 17, 35, 45, 55, 9, 43, 37, 63]