Anyway, it'd be cool if the OEIS had the numbers up to some limit. Maybe 2^16 so it fits into two bytes. It would be at most 1.2MB per entry, but generally way way smaller.
Anyway, it'd be cool if the OEIS had the numbers up to some limit. Maybe 2^16 so it fits into two bytes. It would be at most 1.2MB per entry, but generally way way smaller.
As far as I understand it, though, these B-files aren’t indexed by the search engine.
Even if you have an algorithm to compute them. I appreciate your optimism thought. But OEIS is made by pretty smart people, if it was so simple, it would have been made.
It would be great to make it when possible but the bias will remains.
I don't believe this to be true. Maybe the people who make OEIS have been satisfied with having the description and a few examples.
It would only work well for strictly increasing sequences. I don't know of any sequence that increases slowly and is difficult to compute. If it increases quickly, then you'll quickly pass the limit. If it's not increasing, then you'd have to prove which numbers are under the limit and that could be very challenging in some cases.
I agree! Another opportunity for a paper though!
If f(180) = y = 20067, what does the graph of f(x) look like?
How quickly would f(x) grow? Linearly? Quadratic? Exponential? Logarithmic? Any bets?
Interestingly, this will create a paradox because it could itself be expressed as an OEIS sequence, which would mean that it does not belong in the sequence... but if it doesn't belong, then it should belong(Russell's paradox anyone :D).