_Charles R Greathouse IV_, , <a href="/A193226/b193226.txt">Table of n, a(n) for n = 2..1000</a>
_Charles R Greathouse IV_, , <a href="/A193226/b193226.txt">Table of n, a(n) for n = 2..1000</a>
_Charles R Greathouse IV, _, <a href="/A193226/b193226.txt">Table of n, a(n) for n = 2..1000</a>
(PARI) a(n)=my(N=2^n); forprime(p=2, default(primelimit), if(isprime(N-p), return(p*(N-p)))) \\ _Charles R Greathouse IV, _, Jul 31 2011
_Michel Lagneau (mn.lagneau2(AT)orange.fr), _, Jul 18 2011
proposed
approved
editing
proposed
Charles R Greathouse IV, <a href="/A193226/b193226.txt">Table of n, a(n) for n = 2..1000</a>
(PARI) a(n)=my(N=2^n); forprime(p=2, default(primelimit), if(isprime(N-p), return(p*(N-p)))) \\ Charles R Greathouse IV, Jul 31 2011
approved
editing
proposed
approved
editing
proposed
allocated for Michel LagneauLeast semiprime whose sum of prime factors equals 2^n.
4, 15, 39, 87, 183, 2071, 1255, 1527, 3063, 38551, 12279, 106327, 49143, 622231, 1113823, 1703767, 1310695, 9961111, 3145719, 39845527, 12582903, 310377127, 50331639, 2046816631, 335544295, 10603194271, 23890747663, 1610612727, 44023413103
2,1
a(10) = 3063 because 3063 = 3*1021, and 1021 + 3 = 2^10.
with(numtheory):for n from 1 to 30 do:x:=2^n:id:=0:for m from 1 to 10000 while(id=0) do:p:=ithprime(m):y:=x-p:if type(y, prime)=true then z:=y*p: id:=1:printf(`%d, `, z): else fi:od:od:
Cf. A001358.
allocated
nonn
Michel Lagneau (mn.lagneau2(AT)orange.fr), Jul 18 2011
approved
editing
allocated for Michel Lagneau
allocated
approved