128207979
domain: N
Appears in sequences
- Least number k such that n*k has the fewest possible ones in its binary expansion.at n=66A143069
- Least number k such that the binary expansion of n*k has fewer ones than n, or 0 if no such k exists.at n=66A143073
- a(n) = floor((1 + 2^n)/(1 + 2*n)).at n=32A191633
- Integers of the form (2^k + 1)/(2k + 1).at n=11A247094
- Least number k such that pk is of minimal Hamming weight, where p is the n-th prime.at n=18A278968
- a(n) = (2*(-4)^((p-3)/4) + 1)/p, where p is the n-th prime congruent to 3 mod 4.at n=9A318908
- a(n) = (2^(A003558(n)) - A332433(n))/(2*n+1), for n >= 0.at n=33A329593
- a(n) = (2^A195610(n) + 1)/A014657(n), for n >= 1.at n=21A337220