|
|
A074093
|
|
Number of values of k such that n = k - largest divisor of k (<k).
|
|
1
|
|
|
1, 2, 1, 2, 1, 3, 1, 1, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 3, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 4, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 4, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(2n+1)=1; sum(k=1, n, a(k)) seems to be asymptotic to C*n with C=1.6... - Benoit Cloitre, Aug 21 2002
|
|
EXAMPLE
|
a(6) = 3 and the three values of k are 7,9 and 12.
|
|
MATHEMATICA
|
f1[n_] := Count[Range[n, 2 n], _?(Differences[Take[Divisors[#], -2]] == {n} &)]; Join[{1}, Table[f1[n], {n, 2, 105}]] (* Jayanta Basu, Jul 30 2013 *)
|
|
PROG
|
(PARI) a(n)=sum(k=2, 2*n, if(k- component(divisors(k), numdiv(k)-1)-n, 0, 1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|