|
%I #12 Jan 06 2021 08:30:02
%S 3,12,12,50,18,112,64,126,60,330,72,520,182,240,240,884,198,1368,320,
%T 588,462,1886,360,1650,676,1296,644,3074,390,4030,1248,1848,1292,2380,
%U 864,5328,1596,2496,1280,6560,840,7740,2112,2880,2530,9588,1632,7938,2250,4896,3224,12402,1890,6820,2968
%N a(n) is the sum, for j < n coprime to n, of the least prime > n congruent to j (mod n).
%C For each n >= 3, a(n) is divisible by n.
%H Robert Israel, <a href="/A340354/b340354.txt">Table of n, a(n) for n = 2..3000</a>
%e For n=6 the primes are 7 == 1 (mod 6) and 11 == 5 (mod 6), so a(6) = 7+11=18.
%p f:= proc(n) local t, k,p;
%p t:= 0:
%p for k from 1 to n-1 do
%p if igcd(k,n) = 1 then
%p for p from n+k by n do
%p if isprime(p) then
%p t:= t+p;
%p break
%p fi
%p od
%p fi
%p od;
%p t
%p end proc:
%p map(f, [$2..100]);
%Y Row sums of A060940 (starting with second row).
%K nonn,look
%O 2,1
%A _J. M. Bergot_ and _Robert Israel_, Jan 05 2021
|
