login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066895 Numbers n such that n divides prime(n)+prime(n+1). 0
1, 2, 3, 6, 10, 16, 30, 120, 182, 439, 1058, 4122, 25356, 40086, 40090, 40114, 40120, 63416, 100347, 159222, 251708, 399930, 637328, 637336, 637340, 1014636, 2582486, 4124468, 6592708, 6592728, 10553440, 10553445, 10553829, 16899052 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

PROG

(PARI) {a=2; b=2; for(n=1, 10^6, b=nextprime(b+1); (a+b)%n==0&print(n); a=b)} - Zak Seidov, Dec 28 2010

(MAGMA) S:=[]; p:=2; q:=p; for n in [1..10^7] do q:=NextPrime(q); if (p+q) mod n eq 0 then Append(~S, n); end if; p:=q; end for; S; - Klaus Brockhaus, Dec 28 2010

CROSSREFS

Sequence in context: A034419 A201864 A198200 * A105075 A140669 A001636

Adjacent sequences:  A066892 A066893 A066894 * A066896 A066897 A066898

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 24 2002

EXTENSIONS

Additional terms provided by Harvey P. Dale (hpd1(AT)nyu.edu), Jan 28, 2002

More terms from David W. Wilson (davidwwilson(AT)comcast.net), Feb 20 2002

Merged with an entry submitted by Zak Seidov (zakseidov(AT)yahoo.com), Dec 28 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 05:55 EST 2012. Contains 205860 sequences.