We show that for all positive epsilon, an integer N(epsilon) exists such that if G is any graph of order n greater than or equal to N(epsilon) with minimum degree delta greater than or equal to 32 root n then G contains a cycle of length 21 for each integer I, 2 less than or equal to 1 less than or equal to delta/(16+epsilon).