|
%I #8 Apr 02 2023 11:56:37
%S 1,2,2,4,1,2,1,3,12,3,6,3,6,3,3,24,12,12,12,12,12,12,12,12,6,12,4,12,
%T 12,12,12,60,60,60,60,60,60,60,60,60,60,60,60,60,60,60,60,60,15,60,60,
%U 60,60,60,60,60,60,60,60,60,60,60,60,5,60,60,60,60,60,60,60,60,60,60,60,60,60
%N Denominators of an approximation of Riemann to pi(n).
%C Edwards, p. 22, calls this J(n).
%D J. C. Lagarias and A. M. Odlyzko, Computing pi(x): an analytic method, J. Algorithms, 8 (2087), 173-191.
%D H. M. Edwards, Riemann's Zeta Function, Academic Press, NY, 1974.
%H T. D. Noe, <a href="/A099320/b099320.txt">Table of n, a(n) for n=1..10000</a>
%e 0, 1/2, 3/2, 9/4, 3, 7/2, 4, 14/3, 61/12, 16/3, 35/6, 19/3,...
%t f[n_] := Module[{i, m, p, t1, t2}, t1 = 0; For[i = 1, i <= n, i++, p = Prime[i]; If[p > n, Break[]]; For[m = 1, m <= n, m++, If[p^m > n, Break[]]; If[n == p^m, t2 = 1/(2m), t2 = 1/m]; t1 = t1 + t2]]; t1];
%t Table[f[n] // Denominator, {n, 1, 100}] (* _Jean-François Alcover_, Apr 02 2023, after Maple code in A099319 *)
%Y See A099319 for definition and program.
%K nonn,frac
%O 1,2
%A _N. J. A. Sloane_, Nov 17 2004
|
