|
%I #34 Jun 30 2021 01:53:09
%S 4,21,57,93,183,291,327,395,501,545,695,791,815,831,1145,1205,1415,
%T 1631,1461,1745,1941,1865,2661,2315,2615,2855,2495,2285,3665,2705,
%U 2721,3521,3561,3351,3755,4341,3545,4701,4265,4881,3981,4821,5601,5255,6671,6041,4595
%N Smallest semiprime m = p*q such that the sum s = p + q can be expressed as an unordered sum of two primes in exactly n ways.
%C The unique square and even term of the sequence is a(1) = 4.
%C For n = 1, the sequence of semiprimes having a unique decomposition as the sum of two primes begins with 4, 6, 9, 10, 14, 15, 22, 26, 34, 35, 38, 46, 58, 62, ... containing the even semiprimes (A100484).
%C We observe a majority of terms where a(n) == 5 (mod 10).
%H Michel Marcus, <a href="/A332981/b332981.txt">Table of n, a(n) for n = 1..501</a>
%e a(11) = 695 because 695 = 5*139 and the sum 5 + 139 = 144 = 5+139 = 7+137 = 13+131 = 17+127 = 31+113 = 37+107 = 41+103 = 43+101 = 47+97 = 61+83 = 71+73. There are exactly 11 decompositions of 144 into an unordered sum of two primes.
%p with(numtheory):
%p for n from 1 to 50 do:
%p ii:=0:
%p for k from 2 to 10^8 while(ii=0) do:
%p x:=factorset(k):it:=0:
%p if bigomega(k) = 2
%p then
%p s:=x[1]+k/x[1]:
%p for m from 1 to s/2 do:
%p if isprime(m) and isprime(s-m)
%p then
%p it:=it+1:
%p else fi:
%p od:
%p if it = n
%p then
%p ii:=1: printf(`%d, `,k):
%p else fi:
%p fi:
%p od:
%p od:
%o (PARI) nbp(k) = {my(nb = 0); forprime(p=2, k\2, if (isprime(k-p), nb++););nb;}
%o a(n) = {forcomposite(k=1, oo, if (bigomega(k)==2, my(x=factor(k)[1,1]); if (nbp(x+k/x)==n, return(k));););} \\ _Michel Marcus_, Apr 26 2020
%Y Cf. A001358, A002375, A006881, A023036, A100484, A136244.
%K nonn
%O 1,1
%A _Michel Lagneau_, Mar 05 2020
|
