Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105288
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105288 Numbers n such that prime(n+1) == 3 (mod n). +0
4
4, 5, 70, 440, 1055, 1058, 6461, 6466, 6469 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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

CROSSREFS

Sequence in context: A041941 A013331 A042425 this_sequence A109348 A078985 A041173

Adjacent sequences: A105285 A105286 A105287 this_sequence A105289 A105290 A105291

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research