6 ms·
Try this one: https://oeis.org/A060843 https://oeis.org/A060843
by ttctciyf 4y ago
Try this one: https://oeis.org/A060843 https://oeis.org/A060843
- travisjungroth 4y agoIt's the Busy Beaver problem and BB-5 is proven ≥ 47176870. The list here would be the full list for any "up to n" database smaller than that.
- ttctciyf 4y agoI'm just highlighting that some sequences are not so easily generated. BB(n) is canonically awkward in this regard.