We evaluate [Formula: see text] for a certain family of integer sequences, which include the Fourier coefficients of some modular forms. In particular, we compute [Formula: see text] for all positive integers n for Ramanujan's τ-function. As a consequence, we obtain many congruences — for instance that τ(1000m) is always divisible by 64000. We also determine, for a given prime number p, the set of n for which τ(pn-1) is divisible by n. Further, we give a description of the set {n ∈ ℕ : n divides τ(n)}. We also survey methods for computing τ(n). Finally, we find the least n for which τ(n) is prime, complementing a result of D. H. Lehmer, who found the least n for which |τ(n)| is prime.