225096

Appears in sequences

• Number of labeled 3-connected graphs with n nodes.at n=3A005644
• Erroneous version of A005644 (there appears to be a typo in a(9)).at n=3A123537
• Larger 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=19A322542
• Larger of modified exponential amicable pairs.at n=16A323759
• Larger of exponentially-odd amicable numbers pair: numbers m < k such that m = s(k) and k = s(m), where s(k) is the sum of proper exponential-odd divisors of k.at n=8A325848
• Larger of recursive amicable numbers pair: numbers m < k such that m = s(k) and k = s(m), where s(k) = A333926(k) - k is the sum of proper recursive divisors of k.at n=17A333930