119304645

Appears in sequences

• Greatest odd number that requires n Collatz (3x+1) iterations to reach 1, or zero if there is no such number.at n=32A176868
• Greatest odd number k such that difference between halving and tripling steps in Collatz (3x+1) trajectory of k is n, or 0 if there is no such k.at n=28A222755
• Numbers of the form (2^(2*j + 6*k + 10) - 2^(2*j + 2) - 3)/9, with j,k >= 0.at n=25A342816