A344583 - cp's OEIS frontend

A344583 Let f(k) = k/2 if k is even, otherwise (3k+2a(n)+1)/2, a(n) is the smallest integer greater than -1, where n = f^j(n) for j > 0 exists. f^j(n) means j times recursion into f(n).

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

[0, 0, 0, 1, 2, 2, 1, 3, 5, 4, 2, 3, 7, 5, 3, 7, 5, 8, 4, 2, 3, 10, 5, 2, 16, 5, 5, 13, 9, 2, 7, 2, 20, 10, 8, 5, 22, 2, 2, 16, 11, 11, 10, 5, 12, 22, 2, 11, 16, 2, 8, 25, 5, 14, 13, 8, 9, 7, 2, 8, 10, 8, 5, 31, 20, 18, 16, 15, 12, 7, 5, 8, 49, 8, 12, 16, 2, 8, 16, 5, 27, 40]

cp's OEIS Frontend

A344583 Let f(k) = k/2 if k is even, otherwise (3k+2a(n)+1)/2, a(n) is the smallest integer greater than -1, where n = f^j(n) for j > 0 exists. f^j(n) means j times recursion into f(n).

Table of values

List of values

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

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

cp's OEIS Frontend

A344583 Let f(k) = k/2 if k is even, otherwise (3*k+2*a(n)+1)/2, a(n) is the smallest integer greater than -1, where n = f^j(n) for j > 0 exists. f^j(n) means j times recursion into f(n).

Table of values

List of values

A344583 Let f(k) = k/2 if k is even, otherwise (3k+2a(n)+1)/2, a(n) is the smallest integer greater than -1, where n = f^j(n) for j > 0 exists. f^j(n) means j times recursion into f(n).

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