Best O(n) algorithm to find often appearing numbers?

Question

Let A[1..n] be an array of integer numbers that may appear in any order. Each number is a value in the range between [0..k]. A number x is said to appear often in A if at le