A060322 - cp's OEIS frontend

A060322 Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	3
7	4
8	5
9	6
10	8
11	12
12	18
13	24
14	31
15	39
16	50
17	68
18	91
19	120
20	159
21	211
22	282
23	381
24	505
25	665
26	885
27	1187
28	1590
29	2122
30	2829
31	3765
32	5014
33	6682
34	8902
35	11878
36	15844
37	21122
38	28150
39	37536
40	50067
41	66763
42	89009
43	118631
44	158171
45	210939
46	281334
47	375129
48	500106
49	666725

[1, 1, 1, 1, 2, 3, 4, 5, 6, 8, 12, 18, 24, 31, 39, 50, 68, 91, 120, 159, 211, 282, 381, 505, 665, 885, 1187, 1590, 2122, 2829, 3765, 5014, 6682, 8902, 11878, 15844, 21122, 28150, 37536, 50067, 66763, 89009, 118631, 158171, 210939, 281334, 375129, 500106, 666725]

cp's OEIS Frontend

A060322 Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.

Table of values

List of values