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.

A321905 Irregular table read by rows: T(n,k) is the smallest m such that m^(1/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 11
10 5
11 7
12 9
13 3
14 13
15 15
16 1
17 27
18 21
19 23
20 9
21 19
22 29
23 15
24 17
25 11
26 5
27 7
28 25
29 3
30 13
31 31
32 1
33 59
34 53
35 55
36 9
37 51
38 61
39 47
40 17
41 43
42 5
43 39
44 25
45 35
46 13
47 31
48 33
49 27
50 21
51 23
52 41
53 19
54 29
55 15
56 49
57 11
58 37
59 7
60 57
61 3
62 45
63 63

List of values

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