|
|
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
|
|
|
FORMULA
|
|
|
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)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|