|
| |
|
|
A074746
|
|
Number of distinct differences between consecutive anti-divisors of n (ordered by size).
|
|
1
| |
|
|
0, 0, 0, 0, 1, 0, 2, 1, 1, 2, 2, 1, 3, 2, 1, 1, 3, 3, 2, 1, 2, 3, 4, 1, 4, 2, 4, 3, 2, 1, 4, 3, 4, 2, 4, 1, 3, 4, 3, 3, 3, 4, 3, 2, 5, 4, 4, 2, 5, 5, 2, 5, 5, 2, 4, 2, 4, 4, 4, 5, 3, 3, 6, 1, 4, 4, 6, 6, 2, 4, 4, 5, 5, 4, 2, 4, 7, 4, 2, 4, 5, 5, 6, 3, 5, 4, 5, 4, 2, 3, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,7
|
|
|
COMMENTS
| See A066272 for definition of anti-divisor.
|
|
|
EXAMPLE
| For n=17, anti-divisors={2,3,5,7,11}; differences={1,2,2,4}; a(17) = number of distinct differences = 3.
|
|
|
MAPLE
| read("transforms");
A074746 := proc(n)
local advs ;
advs := sort(convert(antidivisors(n), list)) ;
nops(convert(DIFF(advs), set)) ;
end proc: # R. J. Mathar, Oct 01 2011
|
|
|
CROSSREFS
| Cf. A066272.
Sequence in context: A111949 A143323 A086598 * A133188 A008612 A029320
Adjacent sequences: A074743 A074744 A074745 * A074747 A074748 A074749
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Sep 06 2002
|
| |
|
|