To make some computational experiments with finite nilpotent group - it would be helpful to know the following:
Question: What are the examples of nilpotent (but not commutative) subgroups in symmetric group $S_n$ which are not so big - say less than $10^9$ elements ?
Preferably given by explicit generators (permutations).
The smallest non-abelian nilpotent group is the dihedral group of order 8 the symmetries of a square. This can be realized as a permutation group by keeping track of what a square symmetry does to vertices. Then a rotation acts on vertices by cycling them: $(1 \; 2\; 3 \; 4)$ and a reflection acts by $(1 \; 2)(3 \; 4)$. These generate a copy of $D_4$ in $S_4$.
If you want to do computations, here are two other sources of examples:
Group extensions: a group is nilpotent iff it is an iterated extension by abelian groups. If you're comfortable with semi-direct products, these can lend themselves well to computations.
Upper triangular matrices with 1s on the diagonal. In particular, the Heisenberg group. These groups lend themselves well to computations, and give good intuition about what nilpotent groups ``actually" are when you think about how they act on a vector space.