|
%I #11 Jun 14 2022 15:30:36
%S 4,8,15,10,18,22,34,42,39,64,60,66,74,82,75,115,102,136,106,156,162,
%T 160,203,190,186,210,213,268,226,246,240,291,304,300,306,312,364,330,
%U 344,342,362,368,386,412,448,420,466,450,472,474,496,518,495,539,483,510,594,660,564,609,655,708,636
%N a(n) is the first composite k such that exactly n primes are the sum of all but one of the numbers from 1 to k-1 that are coprime to k, or -1 if there is no such k.
%C Conjecture: for every composite k there is at least one such prime.
%H Robert Israel, <a href="/A354846/b354846.txt">Table of n, a(n) for n = 1..1000</a>
%e a(3) = 15 because 15 is composite, the numbers from 1 to 14 coprime to 15 are 1, 2, 4, 7, 8, 11, 13, 14, and the 3 primes 47 = 1+2+4+7+8+11+14, 53 = 1+2+4+8+11+13+14 and 59 = 2+4+7+8+11+13+14 are sums of all but one of these.
%p f:= proc(n) local C,s;
%p C:= select(t -> igcd(t,n)=1, [$1..n-1]);
%p s:= convert(C,`+`);
%p nops(select(isprime,map(t -> s-t, C)))
%p end proc:
%p N:= 100; # for a(1)..a(N)
%p V:= Vector(N): count:= 0:
%p for nn from 4 while count < N do
%p if isprime(nn) then next fi;
%p v:= f(nn);
%p if v > N then next fi;
%p if V[v] = 0 then count:= count+1; V[v]:= nn fi
%p od:
%p convert(V,list);
%Y Cf.A000010, A023896, A038566.
%K nonn
%O 1,1
%A _J. M. Bergot_ and _Robert Israel_, Jun 08 2022
|
