A354747 - cp's OEIS frontend

A354747 Start with 2n-1; repeatedly triple and add 2 until reaching a prime. a(n) = number of steps until reaching a prime > 2n-1, or 0 if no prime is ever reached.

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

[1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 3, 1, 1, 1, 2, 10, 1, 1, 2, 1, 2, 4, 1, 1, 1, 2, 1, 1, 4, 3, 2, 3, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 2, 1, 3, 3, 1, 1, 2, 3, 3, 5, 1, 1, 1, 2, 3, 9, 1, 1, 2, 1, 2, 4, 1, 2, 1, 6, 1, 1, 2, 1, 1, 5, 1, 3, 1, 2, 1, 1, 3, 1]

cp's OEIS Frontend

A354747 Start with 2n-1; repeatedly triple and add 2 until reaching a prime. a(n) = number of steps until reaching a prime > 2n-1, or 0 if no prime is ever reached.

Table of values

List of values

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

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

cp's OEIS Frontend

A354747 Start with 2*n-1; repeatedly triple and add 2 until reaching a prime. a(n) = number of steps until reaching a prime > 2*n-1, or 0 if no prime is ever reached.

Table of values

List of values

A354747 Start with 2n-1; repeatedly triple and add 2 until reaching a prime. a(n) = number of steps until reaching a prime > 2n-1, or 0 if no prime is ever reached.

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