103968

Appears in sequences

• Least number x such that gcd(phi(x), sigma(x)) = n.at n=26A073815
• Smallest number m such that GCD(a+b,a-b) = n, where a = sigma(m) and b = phi(m).at n=26A077102
• Numbers k such that 2k-1 divides 2^k-1.at n=39A081856
• Powerful numbers (definition 1) sandwiched between twin primes.at n=15A113839
• Averages of twin prime pairs k such that k*2 and k/2 are squares.at n=13A154670
• Number of compositions of n into floor(j/3) kinds of j's for all j>=1.at n=30A176848
• Numbers with prime factorization p^2*q^2*r^5 where p, q, and r are distinct primes.at n=9A190114
• a(n) = n^4 + 2^4 + (n+2)^4.at n=14A190176
• Number n such that Fibonacci(n) is divisible by n, n + 1 and n - 1.at n=17A221018
• Numbers n such that the binary XOR of the divisors of n (A178910) is a binary palindrome (A006995) and not a power of 2 (A000079).at n=32A226643
• Number of (n+2)X(2+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=20A255795
• Least number k such that n divides gcd(sigma(k), phi(k), tau(k)).at n=26A307640
• Primitive terms of A388022: numbers k that satisfy sigma(k) AND 3*k = 3*k, but none of whose proper divisors satisfy the same condition.at n=24A388025