|
Search: id:A071862
|
|
|
| A071862 |
|
Number of elements in the continued fraction for Sum( d divides n, 1/d ). |
|
+0
1
|
|
| 1, 2, 2, 3, 2, 1, 2, 3, 3, 3, 2, 2, 2, 4, 4, 3, 2, 2, 2, 2, 4, 5, 2, 2, 3, 6, 3, 1, 2, 3, 2, 3, 3, 5, 5, 5, 2, 6, 5, 2, 2, 3, 2, 3, 5, 5, 2, 5, 3, 4, 4, 5, 2, 3, 4, 2, 4, 5, 2, 3, 2, 6, 6, 3, 6, 3, 2, 5, 5, 3, 2, 5, 2, 6, 7, 4, 3, 3, 2, 3, 3, 5, 2, 3, 6, 6, 6, 2, 2, 4, 3, 5, 6, 5, 4, 5, 2, 6, 6, 5, 2, 3, 2, 2, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
It seems that sum( k=1, n, a(k) ) ~ C * n * Log(n) with C = 0, 6....
|
|
EXAMPLE
|
Sum( d|48, 1/d ) = 31/12 which continued fraction is [2, 1, 1, 2, 2] with 5 elements, hence a(48)=5
|
|
PROGRAM
|
(PARI) for(n=1, 150, print1(length(contfrac(sumdiv(n, d, 1/d))), ", "))
|
|
CROSSREFS
|
Sequence in context: A127638 A127639 A076494 this_sequence A030362 A044050 A096826
Adjacent sequences: A071859 A071860 A071861 this_sequence A071863 A071864 A071865
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 09 2002
|
|
|
Search completed in 0.002 seconds
|
