Is there any routine technique to find a set of permutations which generate a Sylow $3$-subgroup of the symmetric group $S\_{n}$? 



Sylow 3-subgroups of symmetric group
Such a Sylow $3$-subgroup is a direct product of "iterated wreath products" of the cyclic group of order $3$. It depends on the base $3$ expansion of $n.$ If $n = a\_{0} + 3 a\_{1} + \ldots + 3^{m-1}a\_{m-1}$ where each $a\_{i} \in \{0,2 \}$, then a Sylow $3$-subgroup of $S\_{n}$ is the direct product over $i$ of a direct product of $a\_{i}$ copies the same as a Sylow $3$-subgroup of $S\_{3^{i}}$.
This reduces us to considering the case $n = 3^{m}$ for some $m$.


In that case, one takes a direct product of $3$ copies of a Sylow $3$-subgroup of $S\_{3^{m-1}},$ and then adjoins a product of $3^{m-1}$ $3$-cycles interchanging the sets of points moved by the respective direct factors in a way compatible with their respective actions. This is more complicated to say than to implement:
for example, to go from $S\_{3}$ to $S\_{9},$ take $\langle (123) \rangle \times \langle (456) \rangle \times \langle (789) \rangle$ and adjoin $(147)(258)(369).$


There is nothing in this construction which is particular to the prime $3$. The obvious analogues work for Sylow $p$-subgroups of $S\_{n}$ for any prime $p.$


