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.

A138067 Least k > 1 such that (2n-1)^k + 2 is prime, or 0 if no such number exists.

Table of values

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

List of values

[2, 2, 3, 0, 2, 5, 0, 2, 105, 0, 2, 11, 0, 5, 3, 0, 2, 15, 0, 2, 9, 0, 2, 113, 0, 5, 7, 0, 2, 27, 0, 3, 3, 0, 3, 3, 0, 12, 61, 0, 2, 3, 0, 4, 255, 0, 8, 63, 0, 2, 9, 0, 2, 3473, 0, 2, 3, 0, 2, 15, 0, 2, 87, 0, 3, 23, 0, 36, 1861, 0, 4, 3, 0, 2, 5, 0, 3, 7, 0, 136, 425, 0, 11]