|
Search: id:A060680
|
|
|
| A060680 |
|
Smallest difference between consecutive divisors of n (ordered by size). |
|
+0
9
|
|
| 1, 2, 1, 4, 1, 6, 1, 2, 1, 10, 1, 12, 1, 2, 1, 16, 1, 18, 1, 2, 1, 22, 1, 4, 1, 2, 1, 28, 1, 30, 1, 2, 1, 2, 1, 36, 1, 2, 1, 40, 1, 42, 1, 2, 1, 46, 1, 6, 1, 2, 1, 52, 1, 4, 1, 2, 1, 58, 1, 60, 1, 2, 1, 4, 1, 66, 1, 2, 1, 70, 1, 72, 1, 2, 1, 4, 1, 78, 1, 2, 1, 82, 1, 4, 1, 2, 1, 88, 1, 6, 1, 2, 1, 4
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
a(n) = 1 if n is even, and a(n) is even if n is odd. A060684 contains just the odd-numbered terms.
|
|
REFERENCES
|
A. Balog, P. Erdos and G. Tenenbaum, On Arithmetic Functions Involving Consecutive Divisors. In: Analytical Number Theory, pp. 77-90, Birkhauser, Basel, 1990.
|
|
EXAMPLE
|
For n=35, divisors={1,5,7,35}; differences={4,2,28}; a(35) = smallest difference = 2.
|
|
MATHEMATICA
|
a[n_ ] := Min@@(Drop[d=Divisors[n], 1]-Drop[d, -1])
|
|
CROSSREFS
|
Cf. A060681-A060684.
Sequence in context: A083711 A018783 A114326 this_sequence A057237 A049559 A063994
Adjacent sequences: A060677 A060678 A060679 this_sequence A060681 A060682 A060683
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 19 2001
|
|
EXTENSIONS
|
Corrected by David W. Wilson (davidwwilson(AT)comcast.net), May 04 2001
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 22 2002
|
|
|
Search completed in 0.002 seconds
|
