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.

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

List of values

[1, 1, 1, 0, 1, 1, 1, 4, 0, 1, 1, 1, 1, 0, 2, 1, 1, 1, 0, 5, 1, 4, 1, 0, 1, 1, 1, 2, 0, 1, 2, 1, 1, 0, 1, 2, 1, 1, 0, 1, 5, 5, 2, 0, 1, 1, 1, 3, 0, 2, 1, 1, 7, 0, 1, 1, 2, 1, 0, 2, 1, 1, 1, 0, 2, 1, 8, 1, 0, 1, 2, 1, 1, 0, 7, 1, 1, 4, 0, 4, 1, 2, 1, 0, 2, 5, 1, 2, 0, 1, 1, 2, 3, 0, 1, 1, 9, 2, 0, 1, 1, 1, 1, 0, 1, 6, 1, 2, 0, 1, 3, 1, 4, 0, 1, 2, 23, 1, 0, 4]