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.

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

Table of values

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

List of values

[1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 11, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 113, 0, 1, 7, 0, 1, 1, 0, 3, 1, 0, 1, 1, 0, 12, 1, 0, 1, 3, 0, 1, 255, 0, 8, 1, 0, 1, 1, 0, 1, 1, 0, 1, 3, 0, 2, 15, 0, 2, 1, 0, 1, 23, 0, 1, 1, 0, 4, 3, 0, 1, 1, 0, 3, 1, 0, 136, 1, 0, 1]