login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130642 Numbers n such that 1 + Sum{k=1..n/2}A001223(2k-1)*(-1)^k = 0. 4

%I #2 Mar 30 2012 18:35:47

%S 2,6,14,190,194,200,306,462,468,474,478,490,560,1208,1890,1938,23716,

%T 23850,25226,25834,25968,26642,26650,26998,48316,311888,311922,313946,

%U 331540,331762,331782,377078,377518,377666,377674,377748,378422,378428

%N Numbers n such that 1 + Sum{k=1..n/2}A001223(2k-1)*(-1)^k = 0.

%C Sequence has 170 terms < 10^8.

%C Being prime(n) = 1 + Sum{k=1..n-1}A000040(k)*(-1)^Floor(k/2), for n/2 odd and, prime(n) = (1 + Sum{k=1..n- 1}A000040(k)*(-1)^Floor(k/2))*(-1), for n/2 even.

%e 1 + ( -A001223(1)) = 1+(-1) = 0, hence 2 is a term.

%e 1 + ( -A001223(1) + A001223(3) - A001223(5)) = 1+(-1+2-2) = 0, hence 6 is a term.

%t S=0; a=0; Do[S=S+(Prime[2*k]-Prime[2*k-1])*(-1)^k; If[1+S==0, a++; Print[a, " ", 2*k]], {k, 1, 10^8, 1}]

%Y Cf. A127596, A128039, A001223, A000101, A002386.

%K nonn

%O 1,1

%A _Manuel Valdivia_, Jun 20 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)