%I #25 Jul 04 2024 15:36:02
%S 2,1,2,1,9,1,2,1,1,1,5,8,1,3,2,3,2,2,2,2,1,3,3,4,12,1,1,1,11,4,15,6,3,
%T 3,2,1,20,4,4,1,4,1,2,1,2,6,1,2,1,28,107,1,4,4,3,1,2,2,4,2,3,51,1,1,1,
%U 4,2,4,1,20,20,1,14,3,27,1,4,3,14,329,1,1,1,111,2,3,1,2,1,4,1,6,1,4,1
%N Continued fraction expansion for Sum_{k>=1} d(k)/2^k where d(k) are divisors of k, 1 <= d <= k.
%C A(1669) accurate to 500 decimal digits.
%D Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 354-361.
%H Steven R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/constant/dig/dig.html">Digital Search Tree Constants</a> [Broken link]
%H Steven R. Finch, <a href="http://web.archive.org/web/20010413214937/http://www.mathsoft.com:80/asolve/constant/dig/dig.html">Digital Search Tree Constants</a> [From the Wayback machine]
%o (PARI) {smv(v)= s=0; for(i=1,matsize(v)[2],s=s+v[i]); s }
%o {A066766(n)= sm=0; for(j=1,n,sm=sm+smv(divisors(j)/2^j)); sm*1.0 }
%o (PARI) contfrac(suminf(k=1, sigma(k)/2^k)) \\ _Michel Marcus_, Apr 25 2022
%Y Cf. A066766 (decimal expansion).
%K nonn,cofr
%O 0,1
%A _Randall L Rathbun_, Jan 16 2002
%E Offset changed by _Andrew Howroyd_, Jul 04 2024
|