Kevin Ryde on Fri, 30 Dec 2022 08:00:49 +0100


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: A022921-code 

"Ruud H.G. van Tol" <rvtol@isolution.nl> writes:
>
> [ logint(3^(n+1),2) - logint(3^n,2) |n<-[0..98]]

If n is big, can like to avoid making 3^n only to look at its high bit.
Maybe some dynamically calculated upper and lower bounds on
log(3)/log(2) would be both exact and allow any n.