|
%I #35 Feb 11 2019 21:30:39
%S 3,6,12,20,27,37,46,59,72,84,98,111,125,140,157,172,188,205,221,239,
%T 258,277,296,316,334,353,374,395,418,441,462,484,505,528,549,572,595,
%U 618,641,664,688,712,736,761,786,813,838,862,886,912,937,963,991
%N Number of summation terms of the reciprocal integer squares series that gives the best approximation to n terms of the Euler product for zeta(2).
%C Conjecture: It appears that for integer n the number of summation terms of the reciprocal integer squares series that gives the best approximation to Pi^2/6 - 1/n is n. - _Andrew Howroyd_, Nov 24 2018
%F Conjecture: a(n) = floor(1/(Pi^2/6 - Product{k=1..n} 1/(1-1/prime(k)^2) )). - _Andrew Howroyd_, Nov 24 2018
%e First term of Euler product: 4/3 needs 3 terms for best approximation: 1 + 1/4 + 1/9.
%e Case n=2: The second term of the Euler product is 1/((1-1/2^2)*(1-1/3^2)) = 3/2 = 1.5 which lies between Sum_{k=1..6} 1/k^2 and Sum_{k=1..7} 1/k^2. The first of these is the better approximation so a(2) = 6.
%t x = 70;
%t y = Round[x^1.8];
%t eulerp = Table[Product[1./(1 - 1/Prime[n]^2), {n, 1, k}], {k, 1, y}];
%t sums = Table[{k, Sum[1./n^2, {n, 1, k}]}, {k, 1, y}];
%t diff = Table[Abs[eulerp[[r]] - sums[[All, 2]]], {r, x}];
%t count = Flatten[Array[Range[y] &, x]];
%t fldiff = Flatten[diff];
%t t5 = Transpose[{count, fldiff}];
%t t6 = Partition[t5, y];
%t t7 = Table[MinimalBy[t6[[i]], Last], {i, x}];
%t sol = Flatten[t7, 1][[All, 1]]
%o (PARI) \\ to make this faster use floating point, but beware precision.
%o c(r)={my(s=r-r, k=0); while(s < r, k++; s+=1/k^2); k - (2*(s-r) >= 1/k^2)}
%o a(n)={c(prod(k=1, n, 1/(1-1/prime(k)^2)))} \\ _Andrew Howroyd_, Nov 23 2018
%Y Cf. A007406, A007407, A013661 (zeta(2)), A261208.
%K nonn
%O 1,1
%A _Horst H. Manninger_, Oct 07 2018
|
