Hard-Coding in "One OEIS after another"

Question

This question is about the rules of One OEIS After Another.

A comment was made about hard-coding the values of a particularly difficult sequence, for the sake of keeping the challenge going. Peter Taylor claimed that a hard-coded answer must account for at least 1000 terms or else be invalid. This interpretation of the rules would invalidate a previous answer, forcing the deletion of it and six subsequent answers.

However, the rules also say that you may assume that the required output will not be outside your language's numerical range. I, and others, thought that meant that if required outputs were above, for example, 2³²-1 in a language with 32-bit unsigned ints, then they could be safely ignored. The other view, as I see it, is that it means that your program should assume it has the required memory and not worry about overflow, outputting in this example the correct answer mod 32.

To be fair, the answer at the center of this is mine, so I'm biased, but I think that this should have a consensus before any action (such as deleting seven answers) is taken.

The rules in question are:

• You can assume that neither the input nor the required output will be outside your languages numerical range, but please don't abuse this by choosing a language that can only use the number 1, for example.
• n will never be larger than 1000, or be out of bounds for the sequence, simply to prevent accuracy discrepancies from stopping a language from competing.

Answer 1

I believe the background to

n will never be larger than 1000, or be out of bounds for the sequence, simply to prevent accuracy discrepancies from stopping a language from competing.

was a comment of mine in the sandbox which raised issues about sequences which depend on high-precision values of real numbers. I believe the specific example I gave was a low-numbered sequence which uses π. In my opinion, using that rule as an excuse for hard-coding values up to 1000 is technically legal but bad sportsmanship, and I presume that other people concur because one high-profile answer linked in comments above which does it is currently at +7/-7.

However, in the case of e.g. A000017 hard-coding the sequence is the only option because it is essentially defined as a hard-coded list of values.

The issue of uncomputable sequences is also raised in comments and is an interesting one, but I think it would be getting off-topic for this question to discuss it in detail.

I don't think this rule is relevant to the answer which is the subject of this meta question, since it neither hard-codes 1000 values nor hard-codes a full finite sequence.

---

You can assume that neither the input nor the required output will be outside your languages numerical range, but please don't abuse this by choosing a language that can only use the number 1, for example.

As Riker has mentioned in a comment, there is a standard loophole:

Abusing native number types to trivialize a problem

It is common practice to restrict challenges to cases where input, output and/or intermediate values of the algorithm of choice fit into the language's native number type. At least for input and output, this is generally assumed even if not stated in the challenge specification.

...

As a rule of thumb, I'd say an answer abuses the native number type if the code would require non-trivial modifications for larger number type.

The OEIS question doesn't directly specify whether it uses the same rule of thumb to define abuse, but the intention behind the rule seems to be the same as the intention behind the meta-answer which defines the loophole, and I don't see a good argument against assuming that the same rule of thumb applies. On that basis, hard-coding all of the values which fit inside a language's native integer size is abuse and such answers are not valid.