A290100 - cp's OEIS frontend

A290100 Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced 1 as a member.

n	a(n)
1	1
2	2
3	12
4	3
5	8
6	23
7	381
8	5
9	73
10	12
11	187
12	47
13	39
14	786
15	537
16	8
17	109
18	124
19	2020
20	23
21	19
22	381
23	267
24	81
25	7768
26	60
27	6061
28	73
29	1238
30	1128
31	118945
32	12
33	1120
34	187
35	141
36	234
37	190
38	3999
39	18578
40	39
41	3394
42	28
43	2896
44	747
45	576
46	537
47	56496
48	128
49	533
50	606
51	9757
52	109
53	95
54	12337
55	8656
56	118
57	11306
58	2020
59	9309
60	2309
61	1789
62	258213
63	176262
64	19

[1, 2, 12, 3, 8, 23, 381, 5, 73, 12, 187, 47, 39, 786, 537, 8, 109, 124, 2020, 23, 19, 381, 267, 81, 7768, 60, 6061, 73, 1238, 1128, 118945, 12, 1120, 187, 141, 234, 190, 3999, 18578, 39, 3394, 28, 2896, 747, 576, 537, 56496, 128, 533, 606, 9757, 109, 95, 12337, 8656, 118, 11306, 2020, 9309, 2309, 1789, 258213, 176262, 19]

cp's OEIS Frontend

Table of values

List of values