OFFSET
1,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
L. Adleman, Molecular Computation of Solutions to Combinatorial Problems, Science 266 (1994): 1021-1024.
Aran Nayebi, Fast matrix multiplication techniques based on the Adleman-Lipton model, arXiv:0912.0750 [q-bio.QM], 2009-2011.
D. K. Nguyen, I. Lavallée, and M. Bui, A New Direction to Parallelize Winograd's Algorithm on Distributed Memory Computers, Modeling, Simulation and Optimization of Complex Processes Proceedings of the Third International Conference on High Performance Scientific Computing, March 6-10, 2006, Hanoi, Vietnam: 445-457.
V. Pan, How can we speed up matrix multiplication?, SIAM Review, 26 (1984): 393-416.
S. Robinson, Toward an Optimal Algorithm for Matrix Multiplication, SIAM News 38 (2005): 1-3.
V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969): 354-356. MR 40:2223.
Yahoo Questions, Prove log(base 2)7 is rational?
EXAMPLE
2.807354922...
MATHEMATICA
RealDigits[Log[2, 7], 10, 100][[1]] (* Vincenzo Librandi, Aug 29 2013 *)
PROG
(PARI) log(7)/log(2) \\ Charles R Greathouse IV, May 15 2019
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
STATUS
approved