A257495 - cp's OEIS frontend

A257495 The number of iterations (x -> 2x+1) until a prime is found, starting with prime(n); or 0 if a prime is never found.

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

[1, 1, 1, 2, 1, 4, 2, 2, 1, 1, 2, 2, 1, 24, 2, 1, 2, 4, 2, 4, 2552, 4, 1, 1, 4, 8, 4, 2, 2, 1, 6, 1, 3, 4, 2, 2, 2, 8, 4, 1, 1, 2, 1, 8, 3, 6, 4, 4, 2, 2, 1, 1, 2, 1, 2, 3, 8, 2, 4, 1, 12, 1, 2, 21, 4, 3, 2, 4, 6, 2, 11, 1, 2, 16, 4, 4, 2, 4, 2, 8, 1, 12, 1, 8]

cp's OEIS Frontend

A257495 The number of iterations (x -> 2x+1) until a prime is found, starting with prime(n); or 0 if a prime is never found.

Table of values

List of values