1149823

Appears in sequences

• a(n) = sigma_3(3n+1).at n=33A092342
• Let S(1)={1} and, for n>1 let S(n) be the smallest set containing x+1, x+2, and 2*x for each element x in S(n-1). a(n) is the number of elements in S(n).at n=27A168043
• a(n) = J_9(n)/J_3(n), where J_k is the k-th Jordan totient function.at n=9A381713