The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A131694 Numbers n such that S(n) = prime, where S(n) = S(n-1) + A000040(n)*(-1)^n; S(0)=0. 1
1, 4, 6, 8, 10, 12, 18, 28, 32, 38, 42, 46, 50, 52, 54, 64, 68, 70, 72, 74, 76, 86, 88, 98, 100, 110, 126, 128, 130, 140, 146, 152, 162, 192, 202, 214, 226, 242, 252, 258, 264, 270, 290, 294, 304, 308, 314, 316, 320, 322, 332, 342, 348, 352, 358, 360 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The sequence include as first term the only case where S(n) = -1 times a prime: S(1)=-2.
LINKS
EXAMPLE
S(3)=((0+2*-1)+3*1)+5*-1 = -4, S(4)= -4 + 7*1 = 3 is prime, hence 4 is a term.
S(5)=((((0+2*-1)+3*1)+5*-1)+7*1)+11*-1 = -8, S(6)= -8 + 13*1 = 5 is prime, hence 6 is a term.
MATHEMATICA
S=0; Do[S=S+Prime[n]*(-1)^n; If[PrimeQ[S]==True, Print[n]], {n, 1, 10^3, 1}]
CROSSREFS
Sequence in context: A359330 A307542 A225510 * A053012 A359202 A096160
KEYWORD
nonn
AUTHOR
Manuel Valdivia, Oct 03 2007
STATUS
approved

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 May 21 22:16 EDT 2024. Contains 372741 sequences. (Running on oeis4.)