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.

A264097 Smallest odd number k divisible by 3 such that k*2^n-1 is a prime.

Table of values

n a(n)
0 3
1 3
2 3
3 3
4 3
5 15
6 3
7 3
8 27
9 45
10 15
11 3
12 87
13 9
14 15
15 9
16 45
17 15
18 3
19 51
20 57
21 9
22 33
23 69
24 39
25 57
26 57
27 21
28 27
29 45
30 213
31 15
32 57
33 147
34 3
35 33
36 45
37 21
38 3
39 63
40 117
41 15
42 33
43 3
44 57
45 165
46 33
47 213
48 117
49 69
50 87
51 21
52 183
53 147
54 45
55 3
56 33
57 51
58 111
59 45
60 93
61 69
62 57
63 9
64 3
65 99
66 63

List of values

[3, 3, 3, 3, 3, 15, 3, 3, 27, 45, 15, 3, 87, 9, 15, 9, 45, 15, 3, 51, 57, 9, 33, 69, 39, 57, 57, 21, 27, 45, 213, 15, 57, 147, 3, 33, 45, 21, 3, 63, 117, 15, 33, 3, 57, 165, 33, 213, 117, 69, 87, 21, 183, 147, 45, 3, 33, 51, 111, 45, 93, 69, 57, 9, 3, 99, 63]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.