A317753 - cp's OEIS frontend

A317753 Number of steps to reach 1 in 7x+-1 problem, or -1 if 1 is never reached.

n	a(n)
1	0
2	1
3	13
4	2
5	10
6	14
7	18
8	3
9	7
10	11
11	53
12	15
13	19
14	19
15	23
16	4
17	27
18	8
19	50
20	12
21	73
22	54
23	16
24	16
25	58
26	20
27	20
28	20
29	43
30	24
31	24
32	5
33	47
34	28
35	325
36	9
37	70
38	51
39	32
40	13
41	13
42	74
43	272
44	55
45	55
46	17
47	17
48	17
49	276
50	59
51	40
52	21
53	40
54	21
55	21
56	21
57	63
58	44
59	63

[0, 1, 13, 2, 10, 14, 18, 3, 7, 11, 53, 15, 19, 19, 23, 4, 27, 8, 50, 12, 73, 54, 16, 16, 58, 20, 20, 20, 43, 24, 24, 5, 47, 28, 325, 9, 70, 51, 32, 13, 13, 74, 272, 55, 55, 17, 17, 17, 276, 59, 40, 21, 40, 21, 21, 21, 63, 44, 63]

cp's OEIS Frontend

A317753 Number of steps to reach 1 in 7x+-1 problem, or -1 if 1 is never reached.

Table of values

List of values

n	a(n)
1	0
2	1
3	13
4	2
5	10
6	14
7	18
8	3
9	7
10	11
11	53
12	15
13	19
14	19
15	23
16	4
17	27
18	8
19	50
20	12
21	73
22	54
23	16
24	16
25	58
26	20
27	20
28	20
29	43
30	24
31	24
32	5
33	47
34	28
35	325
36	9
37	70
38	51
39	32
40	13
41	13
42	74
43	272
44	55
45	55
46	17
47	17
48	17
49	276
50	59
51	40
52	21
53	40
54	21
55	21
56	21
57	63
58	44
59	63

n	a(n)
1	0
2	1
3	13
4	2
5	10
6	14
7	18
8	3
9	7
10	11
11	53
12	15
13	19
14	19
15	23
16	4
17	27
18	8
19	50
20	12
21	73
22	54
23	16
24	16
25	58
26	20
27	20
28	20
29	43
30	24
31	24
32	5
33	47
34	28
35	325
36	9
37	70
38	51
39	32
40	13
41	13
42	74
43	272
44	55
45	55
46	17
47	17
48	17
49	276
50	59
51	40
52	21
53	40
54	21
55	21
56	21
57	63
58	44
59	63

n	a(n)
1	0
2	1
3	13
4	2
5	10
6	14
7	18
8	3
9	7
10	11
11	53
12	15
13	19
14	19
15	23
16	4
17	27
18	8
19	50
20	12
21	73
22	54
23	16
24	16
25	58
26	20
27	20
28	20
29	43
30	24
31	24
32	5
33	47
34	28
35	325
36	9
37	70
38	51
39	32
40	13
41	13
42	74
43	272
44	55
45	55
46	17
47	17
48	17
49	276
50	59
51	40
52	21
53	40
54	21
55	21
56	21
57	63
58	44
59	63