login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067548 Least k > n such that gcd(prime(n)+k, n+prime(k)) > 1. 0
2, 6, 5, 5, 7, 17, 9, 11, 11, 13, 13, 23, 15, 26, 17, 17, 19, 19, 20, 22, 22, 23, 25, 26, 26, 29, 29, 33, 31, 41, 32, 34, 35, 35, 37, 54, 38, 44, 41, 43, 43, 44, 45, 47, 47, 53, 49, 96, 51, 53, 52, 55, 55, 64, 57, 57, 59, 59, 61, 91, 62, 67 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a(2)=6 as: gcd(prime(2)+6,2+prime(6)) = gcd(3+6,2+13) =

gcd(9,15) = 3 and gcd(prime(2)+k,2+prime(k))=1 for 2<k<6.

CROSSREFS

Sequence in context: A171897 A105029 A190124 * A053793 A076187 A019655

Adjacent sequences:  A067545 A067546 A067547 * A067549 A067550 A067551

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 28, 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.