This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A385711 #18 Jul 17 2025 16:15:18
%S A385711 2,3,5,7,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,
%T A385711 127,137,149,157,167,173,179,197,251,257,271,317,347,419,431,457,479,
%U A385711 491,521,523,541,547,571,587,617,719,743,751,761,853,857,859,941,947,971,1237,1259
%N A385711 Primes whose digits are all distinct and pairwise coprime.
%C A385711 This sequence has 252 terms, the last being 95471, which have at most 5 digits. This is because each term has at most one even digit and at most 4 odd digits, since gcd(3, 9) = 3.
%C A385711 All terms are in A038618, since if zero is among the digits of a prime p, then p must have at least 3 digits, where at least one of them is greater than 1, say d, and in such a case gcd(0, d) = d ! = 1.
%H A385711 Gonzalo MartÃnez, <a href="/A385711/b385711.txt">Table of n, a(n) for n = 1..252</a>
%e A385711 857 is a term since it is prime and gcd(8, 5) = gcd(5, 7) = gcd(8, 7) = 1.
%t A385711 Select[Prime[Range[10000]], UnsameQ @@ (d = IntegerDigits[#]) && AllTrue[Subsets[d, {2}], CoprimeQ @@ # &] &] (* _Amiram Eldar_, Jul 13 2025 *)
%Y A385711 Subsequence of A029743.
%Y A385711 Cf. A038618.
%K A385711 nonn,base,fini,full
%O A385711 1,1
%A A385711 _Gonzalo MartÃnez_, Jul 07 2025