The k-ary n-cube is one of the most popular interconnection networks for parallel and distributed systems. We prove that a k-ary n-cube with at most 4n - 5 faulty edges but where every vertex is incident with at least two healthy edges is k-pancyclic and bipancyclic for n >= 3 and odd k >= 3.