114953

Appears in sequences

• a(n) = A065824(A047845(n+1)).at n=28A065884
• Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.at n=34A082056
• a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).at n=29A134382
• Number of n X 3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1.at n=11A297390