2016: OEIS Submissions
Title text: SUB: The submission numbers for my accepted OEIS submissions in chronological order
| This explanation may be incomplete or incorrect: Created by an INTEGER SEQUENCE - Please change this comment when editing this page. Do NOT delete this tag too soon.|
If you can address this issue, please edit the page! Thanks.
The OEIS is the Online Encyclopedia of Integer Sequences, a listing of thousands of sequences of integers, generally of real mathematical interest, such as prime numbers or Armstrong numbers. The OEIS normally expects submissions to be accompanied by references to scholarly articles about, or at least referencing, the sequence. They would not be interested in the personal or idiosyncratic sequences proposed by Randall, though they do have the list of IRT stops, perhaps because a NY Times article mentioned that they don't.
Randall is trying to put his integer sequences on the OEIS website, including making OEIS reveal its password.
|43||All integers which do not appear in the example terms of another OEIS sequence||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.|
|44||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 Helvetica font used, its point size, the software used to render it (e.g. kerning algorithm) and possibly other parameters. Also, several numbers sometimes have the same width. For a particular choice of parameters the first 50 terms are: 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...|
|45||The digits of Chris Hemsworth's cell phone number||This request is for actor Chris Hemsworth's phone number|
|46||All integers, in descending order||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.|
|47||The digits of the OEIS serial number for this sequence||This sequence is only important tautologically.|
|48||200 terabytes of nines||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; a file that takes up 200 terabytes of hard disk space would require a supercomputer to hold in its entirety (for reference, this very large math proof from 2016 takes up a similar amount of space).|
200 terabytes is equal to 2 × 1014 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 × 1014, or 100 trillion, terms long.
|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. 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.|
- SUB: All integers which do not appear in the example terms of another OEIS sequence
- SUB: Integers in increasing order of width when printed in Helvetica
- SUB: The digits of Chris Hemsworth's cell phone number
- SUB: All integers, in descending order
- SUB: The digits of the OEIS serial number for this sequence
- SUB: 200 terabytes of nines
- SUB: The decimal representation of the bytes in the root password to the Online Encyclopedia of Integer Sequences server
- [Caption below the panel:]
- OEIS keeps rejecting my submissions
add a comment! ⋅ add a topic (use sparingly)! ⋅ refresh comments!