The following either link to pages with more description or to text files with a ".m" extension.

- CellularAutomatonData is a
*Mathematica*package containing data on boundaries of one-dimensional cellular automata. My packages page contains more information, as does my paper with Charles Brummitt. - List of the rightmost 121 central cells on row 2
^{31}*t*– 1 of rule 30, begun from a single black cell on a white background, for each 1 ≤*t*≤ 2^{11}. It was computed by a Java program and is described in my paper on local nested structure. (See also sequence A094604.)

- Extremal words avoiding fractional powers:
Prefixes of lexicographically least
*a*/*b*-power-free words on the alphabet on non-negative integers.

- Automorphic conjugacy classes in
*F*_{2}: All equivalence classes of words in the free group on two generators, under its automorphism group, containing words up to length 20.

- Large Motzkin numbers: Pre-computed values of sequence A001006.
- Motzkin numbers modulo
*p*^{α}: Finite automata which compute Motzkin numbers modulo various prime powers. - Koyama's table of integer solutions of
*n*=*x*^{3}+*y*^{3}+*z*^{3}. I didn't compute this data, but it doesn't seem to be available digitally anywhere else. (I had to OCR from physical copies.) It accompanies my brief survey of known integer solutions.

- Long-term pocket change: States and transition matrices of Markov chain models for spending coins.
- An overlap cluster of 3000 English words, for which I won $10 in Doron Zeilberger's experimental mathematics course. An overlap cluster is a sequence of words in which consecutive words have nontrivial overlap. In this case, the length of each overlap is 3, and no word pair is used twice. The effect is better seen when aligned.