Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093868
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093868 Smallest prime that differs from a multiple of n by unity. +0
4
2, 3, 2, 3, 11, 5, 13, 7, 17, 11, 23, 11, 53, 13, 29, 17, 67, 17, 37, 19, 41, 23, 47, 23, 101, 53, 53, 29, 59, 29, 61, 31, 67, 67, 71, 37, 73, 37, 79, 41, 83, 41, 173, 43, 89, 47, 281, 47, 97, 101, 101, 53, 107, 53, 109, 113, 113, 59, 353, 59, 367, 61, 127, 127, 131, 67, 269 (list; graph; listen)
OFFSET

1,1

COMMENT

Numbers n such that a(n-1)=a(n+1)=n are A025584 (primes p such that p-2 is not a prime). - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 23 2004

FORMULA

a(n) = min(A034694(n), A038700(n)) for all n >= 1. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 23 2004

CROSSREFS

Cf. A093869.

Cf. A034694 (Smallest prime == 1 (mod n)), A038700 (Smallest prime == -1 (mod n)).

Sequence in context: A102310 A117936 A078331 this_sequence A077942 A077989 A109620

Adjacent sequences: A093865 A093866 A093867 this_sequence A093869 A093870 A093871

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 20 2004

EXTENSIONS

More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 23 2004

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research