339822

Appears in sequences

• Number of ways 2*n-1 people can vote on three candidates so that the Condorcet paradox arises.at n=27A277935
• Lesser of semi-unitary amicable numbers pair: numbers (m, n) such that susigma(m) = susigma(n) = m + n, where susigma(n) is the sum of the semi-unitary divisors of n (A322485).at n=28A322541
• Lesser of modified exponential amicable pairs.at n=23A323758