id prefer it if you would write this in haskell so i can understand what is going on there better. i am saying of the first 1,000 digits after the ones place, each digit of the sequence appears an even number of times, every consecutive subsequence of two appears an even number of times, and every consecutive subsequence of three happens exactly once. please, if you could do some more intelligable work and show your result as standard deviations away from the the exact de bruijn counts i would really appreciate it. etcetcera.
(i dont know where you got the 10 symbols from. im talking about over the entire 1,000 length decimal sequence. etcetera.)
(i dont know where you got the 10 symbols from. im talking about over the entire 1,000 length decimal sequence. etcetera.)