|
Search: id:A060682
|
|
|
| A060682 |
|
Number of distinct differences between consecutive divisors of n (ordered by size). |
|
+0
6
|
|
| 1, 1, 2, 1, 2, 1, 3, 2, 3, 1, 3, 1, 3, 2, 4, 1, 3, 1, 4, 3, 3, 1, 4, 2, 3, 3, 5, 1, 5, 1, 5, 3, 3, 3, 5, 1, 3, 3, 5, 1, 4, 1, 5, 4, 3, 1, 5, 2, 5, 3, 5, 1, 4, 3, 6, 3, 3, 1, 7, 1, 3, 4, 6, 3, 5, 1, 5, 3, 6, 1, 6, 1, 3, 3, 5, 3, 5, 1, 7, 4, 3, 1, 6, 3, 3, 3, 7, 1, 7, 2, 5, 3, 3, 3, 6, 1, 5, 4, 6, 1, 5, 1, 7, 5, 3
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
COMMENT
|
Number of all differences for n is d(n)-1 = A000005(n)-1. Increments are not necessarily different, so a(n)<=d(n)-1.
|
|
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=70, divisors={1,2,5,7,10,14,35,70}; differences={1,3,2,3,4,21,35}; a(70) = number of distinct differences = 6.
|
|
MATHEMATICA
|
a[n_ ] := Length[Union[Drop[d=Divisors[n], 1]-Drop[d, -1]]]
|
|
CROSSREFS
|
Cf. A000005, A060680, A060681, A060683.
Sequence in context: A077807 A112309 A160006 this_sequence A093873 A161148 A143773
Adjacent sequences: A060679 A060680 A060681 this_sequence A060683 A060684 A060685
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 19 2001
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 22 2002
|
|
|
Search completed in 0.002 seconds
|
