Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117391
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117391 Max{GCD(i,j): prime(n) < i < prime(n+1) < j < prime(n+2)}. +0
2
2, 3, 4, 4, 3, 3, 7, 6, 6, 8, 3, 3, 5, 8, 6, 6, 7, 4, 6, 5, 8, 12, 10, 3, 3, 4, 4, 14, 13, 8, 6, 6, 10, 6, 9, 5, 5, 8, 6, 10, 8, 4, 3, 11, 20, 9, 4, 4, 7, 6, 10, 11, 9, 7, 6, 6, 8, 3, 6, 19, 14, 4, 4, 15, 16, 9, 6, 4, 7, 7, 12, 9, 5, 5, 12, 10, 8, 13, 10, 10, 9, 6, 7, 8, 12, 10, 3, 3, 8, 18, 10, 8, 5, 5 (list; graph; listen)
OFFSET

2,1

COMMENT

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

EXAMPLE

a(20) = Max{GCD(i,j): prime(20)<i<prime(21)<j<prime(22)} =

Max{GCD(i,j): 71 < i < 73 < j < 79} =

Max{GCD(72,74),GCD(72,75),GCD(72,76),GCD(72,77),GCD(72,78)} =

Max{2, 3, 4, 1, 6} = 6.

CROSSREFS

Sequence in context: A051951 A107898 A128863 this_sequence A129456 A030412 A059686

Adjacent sequences: A117388 A117389 A117390 this_sequence A117392 A117393 A117394

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