A125711 - cp's OEIS frontend

A125711 In the "3x+1" problem, let 1 denote a halving step and 0 denote an x->3x+1 step. Then a(n) is obtained by writing the sequence of steps needed to reach 1 from 2n and reading it as a decimal number.

n	a(n)
1	1
2	3
3	175
4	7
5	47
6	431
7	87791
8	15
9	743151
10	111
11	22255
12	943
13	751
14	218863
15	175087
16	31
17	5871
18	1791727
19	1431279
20	239
21	191
22	55023
23	44015
24	1967
25	11917039
26	1775
27	3515647479163389605506303638875119
28	481007
29	382703
30	437231
31	108202665749908974283165422824431
32	63
33	95803119

[1, 3, 175, 7, 47, 431, 87791, 15, 743151, 111, 22255, 943, 751, 218863, 175087, 31, 5871, 1791727, 1431279, 239, 191, 55023, 44015, 1967, 11917039, 1775, 3515647479163389605506303638875119, 481007, 382703, 437231, 108202665749908974283165422824431, 63, 95803119]

cp's OEIS Frontend

A125711 In the "3x+1" problem, let 1 denote a halving step and 0 denote an x->3x+1 step. Then a(n) is obtained by writing the sequence of steps needed to reach 1 from 2n and reading it as a decimal number.

Table of values

List of values