Mathematica packages

Here is information on loading a package in Mathematica.
The documentation notebook contains examples of all functions in a package.

General purpose packages (ordered approximately by general interest):

package	description	documentation
ListTricks 2.20	ListTricks is a collection of about 40 structure manipulation, classification, and searching tools that can be thought of as extending the core Mathematica language.	notebook web page
SequenceIdentification 1.21	SequenceIdentification is a collection of tools for identifying and manipulating integer sequences and integers.	notebook web page
Symbolics 1.01	Symbolics is a collection of tools for manipulating polynomials and formal power series.	notebook web page
TeXTools 1.15	TeXTools automates some common tasks involved in writing papers in LaTeX.	notebook web page
StringTricks 1.20	StringTricks is a collection of string manipulation and analyzation tools.	notebook web page

More specific packages, along with the papers they impacted:

package	description	documentation
AdditiveRules 0.91	AdditiveRules is a package for studying additive cellular automaton rules over a commutative monoid.
BijectiveRules 1.10	BijectiveRules is a package for studying right bijective and left bijective cellular automaton rules. paper: Local nested structure in rule 30	notebook web page
BinaryTrees 1.01	BinaryTrees is a package for generating, visualizing, and manipulating binary trees. paper: Pattern avoidance in binary trees	notebook
BinomialCoefficients 1.00	BinomialCoefficients is a package containing implementations of several theorems on the residues and divisibility properties of binomial coefficients.
EquivalentWords 1.11	EquivalentWords is a package for studying equivalence classes of words in the free group F2 under Aut F2. I used this package to compute all equivalence classes for words of length at most 20. paper: Growing words in the free group on two generators	notebook web page
RegularSequences 1.00	RegularSequences is a package for identifying and analyzing automatic and regular sequences. papers: Non-regularity of ⌊α + logk n⌋ p-regularity of the p-adic valuation of the Fibonacci sequence	notebook web page
TreePatterns 1.05 (requires BinaryTrees)	TreePatterns is a package for studying trees that avoid a given tree pattern. If Singular and the interface package by Manuel Kauers and Viktor Levandovskyy are suitably installed, TreePatterns uses Singular to compute Gröbner bases, which is faster than in Mathematica. paper: Pattern avoidance in binary trees	notebook web page

other programs

• rule30.java: a Java program for long-term computation of the right side of a leftful evaluation of rule 30 (and counting the number of rightmost black cells on significant rows). There is little customizability, and one needs to set the initial conditions of the evaluation before compiling. I have already produced extensive data with this code; see my paper on rule 30.