Editing 2016: OEIS Submissions

{| class="wikitable"

|Every OEIS sequence lists several example terms to demonstrate the content of said sequence. This request wants to list all integers which are ''not'' used as examples elsewhere. Any numbers used as example terms for this sequence are not counted, so this list is not self-disqualifying. It is well-defined at any given time. Like many other OEIS sequences, it has infinitely many terms (more precisely, it includes all integers except a finite number). However, it may change at any time, whenever a new sequence or a new example is added to the OEIS. If included, it would therefore have to be constantly updated.

|Integers in increasing order of width when printed in Helvetica

| This sequence is not uniquely defined as it depends on the specific version of the {{w|Helvetica}} font used, its point size, the software used to render it (e.g. kerning algorithm), the handling of equal widths by the sorting algorithm and possibly other parameters. Also, all digits usually have the same width, with the exception of the sequence "11", which is a tiny bit narrower because a kerning pair exists in Helvetica. Without an additional tie-breaker for equal width numbers, the order is: 1 to 9 in no particular order, 11, 10 and 12 to 19 in no particular order and so on; for a particular choice of parameters the first 50 terms might be: 1, 9, 6, 2, 8, 5, 0, 7, 3, 4, 11, 61, 71, 91, 21, 51, 81, 41, 31, 19, 13, 18, 10, 12, 15, 16, 14, 17, 69, 63, 68, 79, 60, 62, 65, 73, 78, 99, 93, 98, 66, 70, 72, 75, 29, 90, 92, 95, 23, 28...  

| This request is for actor {{w|Chris Hemsworth}}'s phone number

|There are an infinite number of integers. To list all integers in descending order, you would have to begin at the largest integer, and terminate only upon reaching the negative integer with the greatest absolute value, both of which are values that cannot be conceived. It is equally impossible to list all integers in ''ascending'' order, for that matter.

|The digits of the OEIS serial number for this sequence

|This sequence is only important tautologically.  

|This sequence would be entirely useless, as there is no mental effort required to conceive a list that consists only of a single repeated term, however arbitrarily large. Such a list is also incredibly wasteful; to give a comparison, [https://phys.org/news/2016-05-math-proof-largest-terabytes.html this very large math proof from 2016] is also 200 terabytes, and requires a supercomputer to hold in its entirety.<br/>

200 terabytes is equal to 2&nbsp;×&nbsp;10¹⁴ bytes. In UTF-8 all ASCII characters, including control characters such as ␂ (start of text) and ␍ (carriage return), can be represented by a single byte. If the list is presumed to be formatted as "␂9␍9␍9 ... 9␍9␃", the first term would take up 3 bytes, and all other terms would take up 2 bytes. Assuming Randall wants the file size to be 200 terabytes ''minimum'', the resulting list would be a minimum of 1&nbsp;×&nbsp;10¹⁴, or 100 trillion, terms long.

Curiously, OEIS does in fact contain an entry that lists "[https://oeis.org/A010734 all nines]".

|49

|The decimal representation of the bytes in the root password to the Online Encyclopedia of Integer Sequences server

|This would give any user the password to OEIS. {{w|Internet troll|What happens next}} anyone can easily forecast.

|59

|The submission numbers for my accepted OEIS submissions in chronological order

|This would only be useful to Randall. If all of his submissions have been rejected, this would be an empty set. However, if this submission is accepted, the set would, by definition, include at least one number (except that this would not be known at the time of submission). Thus, as in the Russell Paradox, this set would out of date as soon as it was accepted, since the set of accepted submission numbers would change at that point.