This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060684 Smallest difference between consecutive divisors (ordered by size) of 2n+1. 4
 2, 4, 6, 2, 10, 12, 2, 16, 18, 2, 22, 4, 2, 28, 30, 2, 2, 36, 2, 40, 42, 2, 46, 6, 2, 52, 4, 2, 58, 60, 2, 4, 66, 2, 70, 72, 2, 4, 78, 2, 82, 4, 2, 88, 6, 2, 4, 96, 2, 100, 102, 2, 106, 108, 2, 112, 4, 2, 6, 10, 2, 4, 126, 2, 130, 6, 2, 136, 138, 2, 2, 4, 2, 148, 150, 2, 4, 156, 2, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Successively greater values of a(n) occur when 2n+1 is prime. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA A060680(2n+1) EXAMPLE For n=38, 2n+1=77; divisors={1,7,11,77}; differences={6,4,66}; a(38) = smallest difference = 4. MATHEMATICA a[n_ ] := Min@@(Drop[d=Divisors[2n+1], 1]-Drop[d, -1]) Array[Min[Differences[Divisors[2*#+1]]]&, 80] (* Harvey P. Dale, Dec 08 2013 *) PROG (Haskell) a060684 = minimum . a193829_row . (+ 1) . (* 2) -- Reinhard Zumkeller, Jun 25 2015 CROSSREFS Cf. A060680. Different from A071294. Cf. A193829, A027750. Sequence in context: A260300 A182291 A071294 * A056134 A097009 A214213 Adjacent sequences:  A060681 A060682 A060683 * A060685 A060686 A060687 KEYWORD nonn AUTHOR Labos Elemer, Apr 19 2001 EXTENSIONS Edited by Dean Hickerson, Jan 22 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 19 16:42 EDT 2019. Contains 323395 sequences. (Running on oeis4.)