20 Oct
2015
20 Oct
'15
2:17 a.m.
Some quick computation suggests it's proportional to log(n). On Mon, 19 Oct 2015 at 22:59 David Wilson <davidwwilson@comcast.net> wrote:
OEIS A036903(n) gives the number of digits of pi you must scan before seeing every possible n-digit substring.
Over all infinite strings of digits, what is the expected number of digits you must scan before seeing every n-digit substring?
_______________________________________________
Seqfan Mailing list - http://list.seqfan.eu/