%N For each base, b, beginning with binary, the number of (b-1)-digit primes with one copy of each digit save one.
%C Note that only decimal 2, 11 and 19 are representable in some base using a copy of each digit in that base (base 2 for the first and base 3 for the others), as a number written in base b with a single copy of each digit is congruent to either 0 or (b-1)/2 modulo b-1.
%e In base 3, 10, 12 and 21 are primes: Decimal 3, 5 and 7. In base 4, of the possibilities only 103 is prime: Decimal 19.
%o (PARI) \\ Starts at base 4 and prints in form 'base:count', bases 2 and 3 done by hand.
%Y Cf. A073643, A116670.
%A _James G. Merickel_, Sep 23 2013
%E a(14) added by _James G. Merickel_, Oct 14 2013