101104

Appears in sequences

• Sum of the numbers in the trajectory of n for the 3x+1 problem.at n=30A033493
• Ulam's conjecture (steps to return n to 1 after division by 2 and, if needed, multiplication by 3 with 1 added).at n=30A049074
• a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)).at n=19A078455
• Row sums of A375266.at n=30A375268