Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117392
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117392 Smallest prime p=prime(k) such that exist i and j with prime(k-1)<i<p<j<prime(k+1) and GCD(i,j)=n. +0
2
7, 11, 47, 29, 23, 37, 157, 97, 199, 89, 127, 113, 317, 331, 839, 479, 293, 211, 541, 1399, 1973, 1637, 1129, 3229, 2971, 3433, 7253, 6397, 2179, 3989, 4297, 1327, 1361, 4831, 7963, 8501, 7283, 4177, 16301, 2503, 17257, 7993, 18839, 16033, 31957, 9587 (list; graph; listen)
OFFSET

2,1

COMMENT

A117391(A049084(a(n)) - 1) = n.

CROSSREFS

Sequence in context: A129865 A062209 A086828 this_sequence A105867 A057290 A003599

Adjacent sequences: A117389 A117390 A117391 this_sequence A117393 A117394 A117395

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 11 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research