Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105290
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105290 Numbers n such that prime(n+1) == 4 (mod n). +0
6
1, 3, 11, 13, 69, 71, 637225, 637253, 637313, 637327, 4124459, 4124685, 27067033 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) n=0; p=2; while(n++, (-4+p=nextprime(p+1))%n | print1(n", ")) \\ M. F. Hasler, Feb 05 2009

CROSSREFS

Cf. A023144, A092044.

Sequence in context: A113049 A079665 A083992 this_sequence A158790 A063963 A101585

Adjacent sequences: A105287 A105288 A105289 this_sequence A105291 A105292 A105293

KEYWORD

nonn,more

AUTHOR

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

EXTENSIONS

Missing first two terms inserted by M. F. Hasler, Feb 04 2009

Additional terms a(11)-a(13) from M. F. Hasler, Feb 05 2009

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research