A125710 - cp's OEIS frontend

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

n	a(n)
0	4
1	80
2	16
3	43280
4	305424
5	10512
6	272
7	87056
8	2320
9	665872
10	64
11	21520
12	4860176
13	1676649379371438023024192690344976
14	141584
15	54056611079304389108412587463696
16	38414608
17	5136
18	1091856
19	11358841104

[4, 80, 16, 43280, 305424, 10512, 272, 87056, 2320, 665872, 64, 21520, 4860176, 1676649379371438023024192690344976, 141584, 54056611079304389108412587463696, 38414608, 5136, 1091856, 11358841104]

cp's OEIS Frontend

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

Table of values

List of values