51168

Appears in sequences

• Abundant numbers n such that n = sigma(k) - 2k, where k = sigma(n) - 2n.at n=3A069085
• Let S(n)=sigma(|n|)-2*n; sequence gives numbers n such that S(S(S(S(n))))=n. May be called {2,1}-Sociable number of orders 1 or 2 or 4.at n=10A113285
• a(0)=1. a(n) = sum of the earlier terms which are divisible by (the number of 1's in the binary representation of n).at n=25A123757
• Number of 0..n arrays x(0..8) of 9 elements with zero 5th differences.at n=36A200332
• a(n) = Sum_{k=0..floor(n/2)} 2^k * binomial(2*k+1,2*n-4*k).at n=14A387765