At the end of the blog MRB constant
I appended a post that mentioned 3/16 is efficient at approximating the MRB constant, 0.187859, since by using three digits we get four+ digits of accuracy 0.1875.
Perhaps a more unlikely, albeit better, approximation to the MRB constant, limit(sum((-1)^n*n^(1/n), n = 1 .. 2*N), N = infinity), is MKB(E^-1,E) = Re(int((-1)^n*n^(1/n), n = exp(-1) .. exp(1))) = 0.1877790313.... Or is it realy that unlikely?
This blog will discuss whether there is a connection between the MRB constant and MKB(E^-1,E) or not. For more on what I call the MKB constant, Abs(int((-1)^n*n^(1/n), n = 1 .. infinity)) , see MRB constant-C.
I could use some help on this blog.
