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.

A038699 Riesel problem: Smallest prime of form n*2^m-1, m >= 0, or 0 if no such prime exists.

Table of values

n a(n)
1 3
2 3
3 2
4 3
5 19
6 5
7 13
8 7
9 17
10 19
11 43
12 11
13 103
14 13
15 29
16 31
17 67
18 17
19 37
20 19
21 41
22 43
23 367
24 23
25 199
26 103
27 53
28 223
29 463
30 29
31 61
32 31
33 131
34 67
35 139
36 71
37 73
38 37
39 311
40 79
41 163
42 41
43 5503
44 43
45 89
46 367
47 751
48 47
49 97
50 199
51 101
52 103
53 211
54 53
55 109
56 223
57 113
58 463
59 241663
60 59
61 487
62 61

List of values

[3, 3, 2, 3, 19, 5, 13, 7, 17, 19, 43, 11, 103, 13, 29, 31, 67, 17, 37, 19, 41, 43, 367, 23, 199, 103, 53, 223, 463, 29, 61, 31, 131, 67, 139, 71, 73, 37, 311, 79, 163, 41, 5503, 43, 89, 367, 751, 47, 97, 199, 101, 103, 211, 53, 109, 223, 113, 463, 241663, 59, 487, 61]