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.

A288160 a(n) = smallest k such that (6*k*n-3)*2^n-1 is prime, or 0 if no such prime exists.

Table of values

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

List of values

[1, 2, 2, 2, 1, 1, 0, 1, 1, 1, 1, 4, 6, 6, 0, 15, 2, 8, 3, 1, 9, 4, 3, 14, 1, 0, 3, 0, 1, 2, 1, 3, 4, 25, 0, 1, 24, 2, 17, 22, 2, 4, 16, 2, 13, 9, 17, 17, 0, 10, 17, 3, 6, 34, 0, 1, 69, 5, 26, 8, 4, 3, 3, 8, 16, 19, 3, 5, 5, 0, 18, 8, 75, 5, 0, 1, 0, 37, 19, 14, 85, 4, 4, 47]