g[n_] := Module[{seen, r, d, l, i, t}, seen = {}; r = {}; d = IntegerDigits[n]; l = Length[d]; For[i = 1, i <= l, i++, t = d[[i]]; If[ ! MemberQ[seen, t], r = Join[r, IntegerDigits[Count[d, t]]]; r = Join[r, {t}]; seen = Append[seen, t]]]; FromDigits[r]];
pr[n_] := Module[{r, t, p1, p, a}, r = {}; t = g[n]; a = True; While[ ! MemberQ[r, t], r = Append[r, t]; t = g[t]]; r = Append[r, t]; p1 = Flatten[Position[r, t]]; p = PrimeQ[Drop[r, p1[[1]]]]; If[MemberQ[p, False], a = False]; a];
l = {}; For[k = 1, k <= 10^4, k++, If[pr[k], l = Append[l, k]]]; l
