61943domain: NAppears in sequencesLet u be any string of n digits from {0,1,2}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-3 number; then a(n) = max_u f(u).at n=14A065844G.f. A(x) satisfies A(x) = 1 / (1 - x*A(x) / (1-x))^3.at n=6A371483