A385957 Prime(n) is the a(n)-th prime having its distinct digits.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 3, 1, 2, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 1, 5, 6, 3, 7, 3, 1, 1, 2, 1, 1, 4, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 3, 1, 1

Offset: 1

Author

David A. Corneth, Jul 13 2025

Keywords

• nonn
• easy
• base
• look

Examples

			a(1) = 1 as prime(1) = 2 is the first prime having its distinct digits {2}.
a(11) = 2 as prime(11) = 31 is the second prime having its disitinct digits {1, 3} (the first is 13).
a(32) = 4 as prime(32) = 131 is the fourth prime having its distinct digits {1, 3} (the first three are 13, 31 and 113).
		

Links

• David A. Corneth, Table of n, a(n) for n = 1..10000
• David A. Corneth, PARI program
• Michael De Vlieger, Scatterplot of a(n), n = 1..10^6.

Crossrefs

Cf. A086066, A254524, A385776.

Programs

Mathematica

Block[{c, f, p}, c[] := 0; f[x] := Union@ IntegerDigits[x]; Reap[Do[p = Prime[n]; Sow[++c[f[p] ] ], {n, 120}] ][[-1, 1]] ] (* Michael De Vlieger, Jul 13 2025 *)

PARI

\\ See Corneth link