Fast F#: Intro to Defining Sequences 

Timers, listeners, and observable data (like sensor data) immediately come to mind.

@@Grimsleeper86 great idea!

Applying a bitmask on a list. Mostly using Seq.unfold when generating things.

I hadn't thought of this before, but they may make a cool control structure for retry logic (e.g. for network requests). You can define a retry backoff strategy as a seq of sleep times (e.g. no backoff could be an infinite series of 5 seconds, or an exponential backoff could double the number of seconds in each item of the seq). Then you define a little wrapper that will sleep N seconds then try a function, returning an option of its result type. Then you can use Seq.pick to get the first Some result. So long as the trying function returns None, the wrapper will continue consuming one item of the seq, sleeping for that long, then running the try function again.

Generating primes and Fibonacci for project Euler problems.

Thanks 😊

Yeah, I noticed that after it went up. I've since changed my recording settings to not record system sound.