46391

Appears in sequences

• a(n) = n + Fibonacci(n+1).at n=23A081659
• Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 5.at n=21A296812
• Number of tripling steps to reach 1 in the 3x+1 (Collatz) problem starting with the n-th Mersenne prime.at n=20A390817