A229122 - cp's OEIS frontend

A229122 For odd m, let f(m) be the odd part of 3m+1. a(n) is the least positive number of f-iterations of 2n-1 to reach an odious number (A000069), or 0 if no such number of f-iterations exists.

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

[1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 2, 2, 1, 3, 2, 3, 3, 2, 2, 2, 1, 2, 1, 1, 1, 3, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 3, 4, 1, 4, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 2]

cp's OEIS Frontend

A229122 For odd m, let f(m) be the odd part of 3m+1. a(n) is the least positive number of f-iterations of 2n-1 to reach an odious number (A000069), or 0 if no such number of f-iterations exists.

Table of values

List of values

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

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

cp's OEIS Frontend

A229122 For odd m, let f(m) be the odd part of 3*m+1. a(n) is the least positive number of f-iterations of 2*n-1 to reach an odious number (A000069), or 0 if no such number of f-iterations exists.

Table of values

List of values

A229122 For odd m, let f(m) be the odd part of 3m+1. a(n) is the least positive number of f-iterations of 2n-1 to reach an odious number (A000069), or 0 if no such number of f-iterations exists.

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