|
%I #38 Dec 30 2018 12:42:41
%S 19,73,103,157,277,313,317,421,443,523,571,607,701,823,853,907,911,
%T 977,1051,1087,1117,1181,1187,1223,1451,1453,1531,1667,1861,2551,2999,
%U 3169,3257,3389,3583,3671,3889,3907,3911,4597,4691,4919,5347,5527,5569,5623,5657,5839
%N Primes p such that if k is the sum of the first p primes then the sum of the first k primes is prime.
%C Primes p such that A007504(A007504(p)) is prime; subsequence of A321342.
%H Ray Chandler, <a href="/A321343/b321343.txt">Table of n, a(n) for n = 1..2500</a>
%e The smallest prime p such that A007504(p) is prime is 19 (sum of first 19 primes is 100 and sum of first 100 primes is 24133, which is prime). Therefore a(1) = 19.
%p N:=2000:
%p for n from 1 to N by 2 do
%p X:=add(ithprime(k),k=1..n);
%p Y:=add(ithprime(j),j=1..X);
%p if isprime(n)and isprime(Y) then print(n);
%p end if:
%p end do:
%t primeSum[n_] := Sum[Prime[i], {i, n}]; Select[Range[300], PrimeQ[#] && PrimeQ[primeSum[primeSum[#]]] &] (* _Amiram Eldar_, Nov 07 2018 *)
%o (PARI) upto(n) = {my(v = vector(n+1), res = List, t = 1, setv, s = 0, Ap = 0, AAp=0, q =0); v[1] = 2; forprime(p = 3, prime(n+1), t++; v[t] = v[t-1] + p); t=1; vt = v[1]; forprime(p = 2, , AAp += p; q++; if(q == vt, if(isprime(t) && isprime(AAp), listput(res, t); print1(t", ")); t++; if(t>=n, return(res)); vt = v[t])); res} \\ _David A. Corneth_, Nov 09 2018
%o (Perl)
%o use ntheory qw(:all);
%o for (my ($i, $k) = (1, 1); ; ++$k) {
%o my $p = nth_prime($k);
%o if (is_prime sum_primes nth_prime sum_primes nth_prime $p) {
%o print "a($i) = $p\n"; ++$i;
%o }
%o } # _Daniel Suteu_, Nov 11 2018
%Y Cf. A007504, A013916, A321439, A321342.
%K nonn
%O 1,1
%A _David James Sycamore_, Nov 06 2018
|
