Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067185
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067185 Numbers n such that prime(n+1)+prime(n)==1 (mod n). +0
2
7, 17, 109, 281, 1669, 6592663, 16899113, 16899145, 16899295, 749973611 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

a = b = 0; Do[b = Prime[n + 1]; If[Mod[a + b, n] == 1, Print[n]]; a = b, {n, 1, 10^9}]

CROSSREFS

Sequence in context: A082738 A092340 A068172 this_sequence A063384 A165246 A118108

Adjacent sequences: A067182 A067183 A067184 this_sequence A067186 A067187 A067188

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 19 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 19 2002

Extended by David W. Wilson (davidwwilson(AT)comcast.net), Feb 20 2002

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research