4 ms·
As far as I'm aware, most OEIS sequences have a variety of different algorithms (Maple, Mathematica) to generate them. It would be nice to be able to extend the
by yunruse 4y ago
As far as I'm aware, most OEIS sequences have a variety of different algorithms (Maple, Mathematica) to generate them. It would be nice to be able to extend these sequences out and see if this has any change to "Sloane's gap".
- ttctciyf 4y agoTry 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.