|
%I #19 Aug 27 2017 19:53:38
%S 1,2,6,8,4,14,10,12,20,18,16,24,26,28,32,34,36,38,22,30,48,56,54,46,
%T 44,42,60,40,50,58,66,62,52,68,64,84,90,72,92,70,96,80,94,78,104,76,
%U 74,106,102,110,88,98,82,108,114,126,116,118,86,100,120,144,122,130,128,136
%N Least previously nonoccurring positive integer such that partial sum + 2 is prime.
%C The sequence is the union of {1} and a permutation of even positive integers. The corresponding partial sums + 1 are 3, 5, 11, 19, 23, 37, 47, 59, 79, 97, 113, 137, 163, 191, 223. See A084758. - _Zak Seidov_, Feb 10 2015
%C Or, first differences of A084758. - _Zak Seidov_, Feb 10 2015
%H Chai Wah Wu, <a href="/A121862/b121862.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = MIN{k>0 such that 2 + k + SUM[i=1..n-1]a(i) is prime and k <> a(i)}.
%e a(1) = 1 because 1+2 = 3 is prime.
%e a(2) = 2 because 1+2+2 = 5 is prime.
%e a(3) = 6 because 1+2+6+2 = 11 is prime.
%e a(4) = 8 because 1+2+6+8+2 = 19 is prime.
%e a(5) = 4 because 1+2+6+8+4+2 = 23 is prime.
%p M:= 300: # to get all entries before the first entry > N
%p a[1]:= 1:
%p s:= 3:
%p R:= {seq(2*i,i=1..M/2)}:
%p found:= true:
%p for n from 2 while found do
%p found:= false;
%p for r in R do
%p if isprime(s+r) then
%p a[n]:= r;
%p s:= s + r;
%p R:= R minus {r};
%p found:= true;
%p break
%p fi
%p od:
%p od:
%p seq(a[i],i=1..n-2); # _Robert Israel_, Feb 10 2015
%t f[s_] := Append[s, k = 1; p = 2 + Plus @@ s; While[MemberQ[s, k] || ! PrimeQ[p + k], k++ ]; k]; Nest[f, {}, 67] (* _Robert G. Wilson v_, Aug 31 2006 *)
%Y Cf. A000040, A121861.
%Y Cf. A084758. - _Zak Seidov_, Feb 10 2015
%K easy,nonn
%O 1,2
%A _Jonathan Vos Post_, Aug 30 2006
%E More terms from _Robert G. Wilson v_, Aug 31 2006
|
