27 Mar
2014
27 Mar
'14
3:44 a.m.
Hello, the function you mention is not the same, 1+Sqrt[1+(Sqrt[1+4^(1-k)]-1)/2]/2^(k/2+1/2) the original one posted is : 1 + 1/4*(2*4^s + 2*(16^s + 1)^(1/2))^(1/2)/(2^s)^2 which pushes the pattern very far when (here s) is equal to 100,1000 or 1000000, far : many billion bits. The one you mention only pushes up to a few hundreds bits I could see. What type of gen. function would push the coefficients up to the billlions without being too big ? I don't see. Best regards, Simon Plouffe