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.

A133832 Least number k > n such that the binary trinomial 1 + 2^n + 2^k is prime, or 0 if there is no such k.

Table of values

n a(n)
1 2
2 3
3 5
4 13
5 6
6 7
7 9
8 9
9 18
10 19
11 14
12 13
13 15
14 17
15 17
16 81
17 20
18 19
19 30
20 33
21 26
22 27
23 38
24 81
25 27
26 35
27 31
28 33
29 35
30 31
31 42
32 458465
33 36
34 45
35 47
36 37
37 67
38 53
39 41
40 57
41 42
42 45
43 46
44 69
45 54
46 57
47 53
48 1009
49 100
50 119
51 55
52 73
53 83
54 67
55 57
56 1265
57 74
58 69
59 66
60 113
61 75
62 101
63 66
64 2241
65 68
66 67
67 70

List of values

[2, 3, 5, 13, 6, 7, 9, 9, 18, 19, 14, 13, 15, 17, 17, 81, 20, 19, 30, 33, 26, 27, 38, 81, 27, 35, 31, 33, 35, 31, 42, 458465, 36, 45, 47, 37, 67, 53, 41, 57, 42, 45, 46, 69, 54, 57, 53, 1009, 100, 119, 55, 73, 83, 67, 57, 1265, 74, 69, 66, 113, 75, 101, 66, 2241, 68, 67, 70]