The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #9 Oct 21 2013 12:19:23
%S 2620,10744,66928,2082464,7677248,1750776704,749380864,7074650624,
%T 25937232896,161899964416,3949032574976,56691934109696,
%U 162222327218176,5469697508737024,21547979005558784,48336727662002176
%N Smallest amicable number of the form 2^n * p * q for which the larger member of the amicable pair has the same form, where p and q are distinct odd primes.
%C That is, the amicable pair is (2^n pq, 2^n rs) for odd primes p, q, r, s. See A180331 for the numbers 2^n rs. It is easy to show that the four primes must satisfy the equation (p+1)(q+1) = (r+1)(s+1). These amicable pairs are a subset of the regular type (2,2) pairs, which are cataloged by Pedersen. These amicable pairs can be found by using Herman te Riele's method 2. Amicable pairs of this form are known for 1 < n < 49. Do they exist for all n?
%H J. M. Pedersen, <a href="http://amicable.adsl.dk/aliquot/apstat/apreg22.txt">Regular type (2,2) amicable pairs</a>
%H Herman J. J. te Riele, <a href="http://www.ams.org/journals/mcom/1984-42-165/S0025-5718-1984-0725997-0/">On generating new amicable pairs from given amicable pairs</a>, Math. Comp. 42 (1984), 219-223.
%K nonn
%O 2,1
%A _T. D. Noe_, Sep 07 2010