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.

A377364 a(n) = least k such that 2n*3^k-2 is prime, or 0 if no prime is reached.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 4, 5, 1, 2, 1, 2, 1, 1, 1, 9, 2, 1, 4, 1, 1, 2, 1, 5, 1, 1, 11, 1, 2, 2, 4, 3, 1, 1, 1, 3, 2, 4, 1, 1, 5, 3, 1, 1, 3, 1, 2, 4, 1, 1, 1, 2, 2, 1, 5, 1, 3, 1, 2, 1, 1, 8, 3, 1, 1, 4, 2, 80, 1, 6, 1, 8, 2, 2]