43215

Appears in sequences

• a(n) = T(n, 2*n-7), T given by A027960.at n=13A027969
• Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=37A039752
• Number of primitive (period n) n-bead necklaces with exactly three different colored beads.at n=11A056288
• Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=36A064678
• Array read by rows in which the n-th row contains the multiples of n in increasing order using all the digits of first n numbers.at n=37A078189
• Largest multiple of n that can be formed using the digits of first n natural numbers.at n=4A083431
• Numbers with 5 distinct digits {1,2,3,4,5} such that all adjacent digits (as well as first and last digits) are coprime.at n=41A104972
• Least k such that the sum of the semiprime divisors equals n times the sum of the prime divisors, or 0 if no such k exists.at n=30A227419