login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074879 10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1). 0
1, 9, 9, 3, 1, 1, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 9, 3, 9, 3, 3, 1, 9, 3, 1, 1, 3, 9, 9, 3, 3, 1, 1, 3, 9, 9, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 9, 9, 1, 1, 9, 3, 1, 9, 1, 3, 1, 1, 9, 1, 1, 1, 3, 1, 3, 9, 9, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 9, 9, 1, 3, 9, 1, 3, 1, 9, 3, 1, 9, 9, 9, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
10 - Mod[ Prime[ Select[ Range[5220], Prime[ # ] + 22 == Prime[ # + 1] & ]], 10]
10-Mod[#, 10]&/@Transpose[Select[Partition[Prime[Range[6000]], 2, 1], Last[#]- First[#]==22&]][[1]] (* Harvey P. Dale, Apr 12 2011 *)
PROG
(Magma) [10-(n mod 10): n in PrimesUpTo(50000) | n+22 eq NextPrime(n)]; // Bruno Berselli, Apr 12 2011
CROSSREFS
Sequence in context: A110639 A254273 A011211 * A291366 A146490 A222810
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, Sep 30 2002
EXTENSIONS
Edited by Robert G. Wilson v and N. J. A. Sloane, Oct 03 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:38 EDT 2024. Contains 371989 sequences. (Running on oeis4.)