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.

A122182 Least positive number k such that 2^k mod k = 2n, or 0 if no such k exists.

Table of values

n a(n)
0 1
1 3
2 6
3 10669
4 9
5 18
6 3763
7 1010
8 20
9 35
10 2951
11 42
12 50
13 27
14 36
15 49
16 56
17 110
18 697
19 578
20 156
21 540923
22 70
23 287
24 104
25 147
26 4044
27 970
28 220
29 59378
30 119
31 345
32 66
33 3007
34 75
35 1990362
36 184
37 190
38 100
39 115
40 81
41 162
42 470
43 406
44 812
45 6631
46 105
47 310
48 160
49 207
50 322

List of values

[1, 3, 6, 10669, 9, 18, 3763, 1010, 20, 35, 2951, 42, 50, 27, 36, 49, 56, 110, 697, 578, 156, 540923, 70, 287, 104, 147, 4044, 970, 220, 59378, 119, 345, 66, 3007, 75, 1990362, 184, 190, 100, 115, 81, 162, 470, 406, 812, 6631, 105, 310, 160, 207, 322]