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.

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

Table of values

n a(n)
0 0
1 4700063497
2 19147
3 25
4 2228071
5 262279
6 95
7 481
8 45
9 2873
10 3175999
11 555
12 95921
13 174934013
14 777
15 140039
16 2463240427
17 477
18 91
19 623
20 2453
21 55
22 345119
23 1131
24 943
25 21967
26 135
27 46979
28 125
29 3811
30 23329
31 155
32 1064959
33 245

List of values

[0, 4700063497, 19147, 25, 2228071, 262279, 95, 481, 45, 2873, 3175999, 555, 95921, 174934013, 777, 140039, 2463240427, 477, 91, 623, 2453, 55, 345119, 1131, 943, 21967, 135, 46979, 125, 3811, 23329, 155, 1064959, 245]