Let C be the set of function f:Nk→N which are both total and computable. Then C is not computably enumerable.
By diagonalization. Assume C is computably enumerable. Let {fi} denote the enumeration. Define a new computable function by
g(n)=fn(n)+1
Then g is total since it is a composition of total functions. However, it differs from every function in {fn} on the value n, meaning that g cannot be in {fn} and hence cannot be computable.