We prove that if C a y (G; S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then C a y (G; S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp with 2 4 6 not equal k < 3 2, or of the form k p q with k <= 5, or of the form p q r, or of the form k p 2 with k <= 4, or of the form kp(3) with k <= 2.