Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000826
Mapping
St000826: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => 1
1 => 7
00 => 2
01 => 5
10 => 8
11 => 16
000 => 3
001 => 19
010 => 6
011 => 14
100 => 9
101 => 9
110 => 17
111 => 17
0000 => 4
0001 => 12
0010 => 20
0011 => 20
0100 => 7
0101 => 7
0110 => 15
0111 => 15
1000 => 10
1001 => 23
1010 => 10
1011 => 111
1100 => 18
1101 => 18
1110 => 18
1111 => 106
00000 => 5
00001 => 26
00010 => 13
00011 => 13
00100 => 21
00101 => 21
00110 => 21
00111 => 34
01000 => 8
01001 => 109
01010 => 8
01011 => 29
01100 => 16
01101 => 16
01110 => 16
01111 => 104
10000 => 11
10001 => 24
10010 => 24
10011 => 24
Description
The stopping time of the decimal representation of the binary word for the 3x+1 problem. Prepend $1$ to the binary word, interpret it as a positive number, and count the number of halving and tripling steps needed to reach $1$.