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.

A264098 Smallest odd number k divisible by 3 such that k*2^n + 1 is prime.

Table of values

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

List of values

[3, 3, 9, 15, 3, 3, 9, 3, 15, 15, 9, 3, 33, 9, 81, 21, 9, 3, 27, 27, 33, 27, 45, 45, 33, 27, 15, 33, 45, 3, 39, 81, 9, 75, 81, 3, 15, 15, 81, 27, 3, 9, 9, 15, 189, 27, 27, 15, 105, 27, 75, 93, 51, 177, 57, 27, 75, 99, 27, 45, 105, 105, 9, 27, 9, 3, 9, 237]

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

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