41261

Appears in sequences

• Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=35A039752
• Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1).at n=31A075654
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, 0), (1, 1, -1), (1, 1, 0)}.at n=8A150452
• a(n) = 78*n^2 - 1.at n=22A158771
• 1, followed by list of numbers n such that the number of strong primes and the number of weak primes are equal at the n-th prime.at n=10A175102
• Positive integers of the form (30*m^2+1)/11.at n=22A179339
• From Wendt's determinant compute (-A048954(2*n)/3)^(1/3).at n=4A215616
• Number of maximal cliques in the n-polygon diagonal intersection graph.at n=28A291949
• Numbers k such that sopfr(k) = tau(k)^2.at n=26A305026
• Numbers k such that the sums (with multiplicity) of prime factors of k and k+1 are both squares.at n=38A359445