Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067548
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067548 Least k > n such that gcd(prime(n)+k, n+prime(k)) > 1. +0
1
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; listen)
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: A021381 A157890 A105029 this_sequence A053793 A076187 A019655

Adjacent sequences: A067545 A067546 A067547 this_sequence A067549 A067550 A067551

KEYWORD

nonn

AUTHOR

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

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