A343914 - cp's OEIS frontend

A343914 Riesel problem in base 3: a(n) is the smallest k >= 0 such that (2n)3^k-1 is prime, or -1 if no such k exists.

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

[1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 2, 1, 0, 0, 1, 1, 0, 2, 0, 0, 1, 0, 1, 2, 0, 1, 1, 0, 0, 1, 1, 0, 3, 0, 0, 1, 1, 0, 3, 0, 1, 1, 0, 2, 1, 2, 0, 3, 0, 0, 1, 0, 0, 3, 0, 1, 1, 1, 2, 3, 9, 0, 1, 0, 1, 2, 0, 0, 2, 1, 6, 1, 0, 0, 1, 1, 0, 1, 3, 0, 2, 0, 1, 3, 0]

cp's OEIS Frontend

A343914 Riesel problem in base 3: a(n) is the smallest k >= 0 such that (2n)3^k-1 is prime, or -1 if no such k exists.

Table of values

List of values

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

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

cp's OEIS Frontend

A343914 Riesel problem in base 3: a(n) is the smallest k >= 0 such that (2*n)*3^k-1 is prime, or -1 if no such k exists.

Table of values

List of values

A343914 Riesel problem in base 3: a(n) is the smallest k >= 0 such that (2n)3^k-1 is prime, or -1 if no such k exists.

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