A052333 - cp's OEIS frontend

A052333 Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.

n	a(n)
1	3
2	5
3	7
4	19
5	11
6	13
7	31
8	17
9	19
10	43
11	23
12	103
13	223
14	29
15	31
16	67
17	71
18	37
19	79
20	41
21	43
22	367
23	47
24	199
25	103
26	53
27	223
28	463
29	59
30	61
31	127
32	131
33	67
34	139
35	71
36	73
37	151
38	311
39	79
40	163
41	83
42	5503
43	738197503
44	89
45	367
46	751
47	191
48	97
49	199
50	101
51	103
52	211
53	107
54	109
55	223
56	113
57	463

[3, 5, 7, 19, 11, 13, 31, 17, 19, 43, 23, 103, 223, 29, 31, 67, 71, 37, 79, 41, 43, 367, 47, 199, 103, 53, 223, 463, 59, 61, 127, 131, 67, 139, 71, 73, 151, 311, 79, 163, 83, 5503, 738197503, 89, 367, 751, 191, 97, 199, 101, 103, 211, 107, 109, 223, 113, 463]

cp's OEIS Frontend

A052333 Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.

Table of values

List of values