100144

Appears in sequences

• a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.at n=51A005186
• Positive numbers k such that k and 4*k are anagrams in base 6 (written in base 6).at n=4A023066
• Smallest number with n nonprime substrings (Version 2: substrings with leading zeros are counted as nonprime if the corresponding number is > 0).at n=18A213303
• Smallest number with n nonprime substrings (Version 3: substrings with leading zeros are counted as nonprime if the corresponding number is not a prime).at n=18A213304