|
%I #10 Feb 02 2018 02:55:09
%S 7,11,19,41,79,163,331,653,1307,2617,5231,10463,20929,41863,83717,
%T 167437,334877,669763,1339523,2679037,5358083,10716163,21432317,
%U 42864671,85729367,171458671,342917357,685834729,1371669443,2743338881
%N a(1) = 7; for n > 1, a(n) = smallest prime strictly greater than sum of previous terms.
%H Harvey P. Dale, <a href="/A165549/b165549.txt">Table of n, a(n) for n = 1..1000</a>
%t a=7;b=11;s=a+b;lst={a,b};Do[i=1;While[ !PrimeQ[s+i],i++ ];c=s+i;AppendTo[lst,c];a=b;b=c;s+=c,{n,2*4!}];lst
%t nxt[{t_,a_}]:=Module[{c=NextPrime[t]},{t+c,c}]; NestList[nxt,{7,7},30][[All,2]] (* _Harvey P. Dale_, Aug 03 2017 *)
%o (PARI) {m=30; s=0; v=vector(m); v[1]=7; for(n=2, m, s+=v[n-1]; v[n]=nextprime(s+1)); v} \\ _Klaus Brockhaus_, Sep 25 2009
%Y Cf. A064934, A070218.
%K nonn
%O 1,1
%A _Vladimir Joseph Stephan Orlovsky_, Sep 21 2009
%E Edited by _Klaus Brockhaus_, Sep 25 2009
|
