I actually disagree with this. It doesn't matter much to me, because I consider MO my home and only drop by math.SE occasionally. But, for the record, I think I should be able to ask a question like the following one. The details here are made up, but this is similar to e-mails I have sent to experts in the past:
In studying a problem in the subfactor
theory, I have an encountered a
construction which assigns a vector
space to any finite group. Applying my
construction to the symmetric groups
$S_n$, I get trivial vector spaces for
$S_n$ with $n \leq 8$, and then the
next spaces have dimensions
$$1,\ 8,\ 45,\ 208,\ 858,\ 3276.$$
At that point, I overflow my computer's memory, but I
hope to run $S_{15}$ on a more
powerful machine soon. Does anyone
recognize this sequence? These numbers all have small prime factors, but I can't find a
multiplicative formula for them. The sequence is not in OEIS.
Key points: This is a question that actually comes from a practical problem, not a riddle. I give background information that might be useful, such as that these numbers come from symmetric groups and that there may be some sense in which there is a row of zeroes at the beginning. I show that I have done my work, by looking at the data I have and consulting standard references like OEIS.
A much better rule would be that there should be some external objective right answer, such as the computation for $S_{15}$ which I claim to be running.
PS I actually grabbed these numbers from this blogpost, and named subfactor theory based on the comment on that post by Dave Penneys. The vector spaces, symmetric groups and massive computation are fiction.