Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130642
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130642 Numbers n such that 1 + Sum{k=1..n/2}A001223(2k-1)*(-1)^k = 0. +0
4
2, 6, 14, 190, 194, 200, 306, 462, 468, 474, 478, 490, 560, 1208, 1890, 1938, 23716, 23850, 25226, 25834, 25968, 26642, 26650, 26998, 48316, 311888, 311922, 313946, 331540, 331762, 331782, 377078, 377518, 377666, 377674, 377748, 378422, 378428 (list; graph; listen)
OFFSET

1,1

COMMENT

Sequence has 170 terms < 10^8.

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.

EXAMPLE

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

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

MATHEMATICA

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}]

CROSSREFS

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

Sequence in context: A055691 A072171 A131518 this_sequence A119416 A134891 A020947

Adjacent sequences: A130639 A130640 A130641 this_sequence A130643 A130644 A130645

KEYWORD

nonn

AUTHOR

Manuel Valdivia (mvaldivia(AT)ugr.es), Jun 20 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research