|
Search: id:A074093
|
|
|
| A074093 |
|
Number of values of k such that n = k - largest divisor of k (<k). |
|
+0
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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(2n+1)=1; sum(k=1, n, a(k)) seems to be asymptotic to C*n with C=1.6... - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 21 2002
|
|
EXAMPLE
|
a(6) = 3 and the three values of k are 7,9 and 12.
|
|
PROGRAM
|
(PARI) a(n)=sum(k=2, 2*n, if(k- component(divisors(k), numdiv(k)-1)-n, 0, 1))
|
|
CROSSREFS
|
Cf. A073932, A073933, A073934, A073935, A060681.
Sequence in context: A112165 A112186 A112187 this_sequence A048220 A078380 A062356
Adjacent sequences: A074090 A074091 A074092 this_sequence A074094 A074095 A074096
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 19 2002
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr) and Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 21 2002
|
|
|
Search completed in 0.002 seconds
|
