|
%I #20 Dec 15 2017 17:34:56
%S -3,-1,-1,16,-1,28,-1,40,101,-1,133,76,-1,88,197,221,-1,253,136,-1,
%T 301,160,341,554,196,-1,208,-1,220,1433,256,533,-1,1147,-1,613,637,
%U 328,677,701,-1,1483,-1,388,-1,2044,2164,448,-1,460,941,-1,1963,1013,1037,1061,-1,1093,556,-1,2299,3593,616,-1,628,3881
%N a(n) = n-th prime prime(n) subtracted from sum of all composites between prime(n) and prime(n-1).
%H James Spahlinger, <a href="/A060325/b060325.txt">Table of n, a(n) for n = 2..1000</a>
%F a(n) = A054265(n-1) - A065091(n-1). - _James Spahlinger_, Feb 20 2016
%e a(2) = 0 - 3 = -3. a(5) = (8+9+10) - 11 = 16.
%t a[n_] := Total@Range[Prime[n - 1] + 1, Prime[n] - 1] - Prime[n]; Array[a,50,2] (* _James Spahlinger_, Feb 20 2016 *)
%K easy,sign
%O 2,1
%A _Jason Earls_, Apr 10 2001
%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), Apr 20 2001
|
