A344681 - cp's OEIS frontend

A344681 a(n) is the smallest k > n such that 2^(k-n) == 1 (mod k).

n	a(n)
0	1
1	3
2	20737
3	9
4	7
5	25
6	31
7	15
8	127
9	17
10	73
11	15
12	23
13	33
14	3479
15	21
16	31
17	65
18	131071
19	51
20	524287
21	31
22	127
23	33
24	47
25	69
26	31
27	39
28	49
29	43
30	233
31	87
32	1361567
33	45
34	89
35	51
36	71
37	73
38	223
39	57
40	79
41	65
42	13367
43	51
44	431
45	63
46	73
47	69
48	2351
49	97
50	127
51	63
52	103
53	65
54	6361
55	73
56	89
57	63
58	721
59	87
60	179951

[1, 3, 20737, 9, 7, 25, 31, 15, 127, 17, 73, 15, 23, 33, 3479, 21, 31, 65, 131071, 51, 524287, 31, 127, 33, 47, 69, 31, 39, 49, 43, 233, 87, 1361567, 45, 89, 51, 71, 73, 223, 57, 79, 65, 13367, 51, 431, 63, 73, 69, 2351, 97, 127, 63, 103, 65, 6361, 73, 89, 63, 721, 87, 179951]

cp's OEIS Frontend

A344681 a(n) is the smallest k > n such that 2^(k-n) == 1 (mod k).

Table of values

List of values