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.

A250205 Riesel problem in base 6: Least k > 0 such that n*6^k-1 is prime, or 0 if no such k exists.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 0
7 1
8 1
9 1
10 1
11 0
12 1
13 2
14 1
15 1
16 0
17 1
18 1
19 1
20 2
21 0
22 1
23 1
24 2
25 1
26 0
27 2
28 1
29 1
30 1
31 0
32 1
33 1
34 2
35 2
36 0
37 4
38 1
39 1
40 1
41 0
42 1
43 1
44 1
45 1
46 0
47 1
48 4
49 1
50 3
51 0
52 1
53 1
54 6
55 2
56 0
57 5
58 1
59 1
60 1
61 0
62 6
63 2
64 1
65 1
66 0
67 1
68 2
69 10
70 1
71 0
72 1
73 3
74 1
75 1
76 0
77 1
78 1
79 2
80 1
81 0
82 1
83 8
84 1
85 1
86 0
87 1
88 2
89 2
90 4
91 0
92 49
93 1
94 1
95 1
96 0
97 2
98 1
99 1
100 1
101 0
102 2
103 1
104 6
105 2
106 0
107 1
108 1
109 1
110 1
111 0
112 5
113 1
114 1
115 2
116 0
117 1
118 10
119 2
120 1

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 0, 2, 1, 1, 1, 0, 1, 1, 2, 2, 0, 4, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 4, 1, 3, 0, 1, 1, 6, 2, 0, 5, 1, 1, 1, 0, 6, 2, 1, 1, 0, 1, 2, 10, 1, 0, 1, 3, 1, 1, 0, 1, 1, 2, 1, 0, 1, 8, 1, 1, 0, 1, 2, 2, 4, 0, 49, 1, 1, 1, 0, 2, 1, 1, 1, 0, 2, 1, 6, 2, 0, 1, 1, 1, 1, 0, 5, 1, 1, 2, 0, 1, 10, 2, 1]