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.

A210651 a(n)=least odd number k such that 3*k*2^n-1 is a prime number.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 5
6 1
7 1
8 9
9 15
10 5
11 1
12 29
13 3
14 5
15 3
16 15
17 5
18 1
19 17
20 19
21 3
22 11
23 23
24 13
25 19
26 19
27 7
28 9
29 15
30 71
31 5
32 19
33 49
34 1
35 11
36 15
37 7
38 1
39 21
40 39
41 5
42 11
43 1
44 19
45 55
46 11
47 71
48 39
49 23
50 29
51 7
52 61
53 49
54 15
55 1
56 11
57 17
58 37
59 15
60 31
61 23
62 19
63 3
64 1
65 33
66 21
67 37
68 21
69 17
70 9
71 41
72 43
73 5
74 7
75 25
76 1
77 19
78 37
79 23
80 5
81 27
82 5
83 37
84 31
85 15
86 85
87 67
88 43
89 79
90 77

List of values

[1, 1, 1, 1, 5, 1, 1, 9, 15, 5, 1, 29, 3, 5, 3, 15, 5, 1, 17, 19, 3, 11, 23, 13, 19, 19, 7, 9, 15, 71, 5, 19, 49, 1, 11, 15, 7, 1, 21, 39, 5, 11, 1, 19, 55, 11, 71, 39, 23, 29, 7, 61, 49, 15, 1, 11, 17, 37, 15, 31, 23, 19, 3, 1, 33, 21, 37, 21, 17, 9, 41, 43, 5, 7, 25, 1, 19, 37, 23, 5, 27, 5, 37, 31, 15, 85, 67, 43, 79, 77]