A050412 - cp's OEIS frontend

A050412 Riesel problem: start with n; repeatedly double and add 1 until reaching a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

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

[1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 4, 1, 1, 2, 2, 1, 2, 1, 1, 4, 1, 3, 2, 1, 3, 4, 1, 1, 2, 2, 1, 2, 1, 1, 2, 3, 1, 2, 1, 7, 24, 1, 3, 4, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 12, 2, 3, 4, 2, 1, 4, 1, 5, 2, 1, 1, 2, 4, 7, 2552, 1, 1, 2, 2, 1, 4, 3, 1, 2, 1, 5, 6, 1, 23, 4, 1, 1, 2, 3, 3, 2, 1, 1, 4, 1, 1]

cp's OEIS Frontend

A050412 Riesel problem: start with n; repeatedly double and add 1 until reaching a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

Table of values

List of values