Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105287
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105287 Numbers n such that prime(n+1) == 2 (mod n). +0
4
9, 67, 437, 441, 2615, 100349, 100353, 100359 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

bb={}; Do[If[2==Mod[Prime[n+1], n], bb=Append[bb, n]], {n, 1, 200000}]; bb

CROSSREFS

Sequence in context: A098107 A091647 A106132 this_sequence A163349 A016130 A115202

Adjacent sequences: A105284 A105285 A105286 this_sequence A105288 A105289 A105290

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Apr 25 2005

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research