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 A160402 #18 Sep 08 2022 08:45:45
%S A160402 23456789,23458679,23459687,23465789,23465987,23469587,23475869,
%T A160402 23478569,23489657,23495867,23496587,23498567,23546879,23546987,
%U A160402 23548697,23564897,23564987,23567849,23569487,23576489,23584679,23587649,23589647,23594687
%N A160402 Primes made up of all distinct digits except 0 and 1.
%C A160402 More precisely, "primes made up of all distinct digits from 2 to 9, each occurring once." Since this restricts the number of digits to 8, the sequence is finite.
%C A160402 The last term of this sequence is a(3098) = 98745623. - _Nathaniel Johnston_, Jun 24 2011
%C A160402 Also numbers n such that the list of divisors of n contains all the digits 1-9 and each digit appears exactly once (in base 10). There are no composite numbers with this property. Numbers n such that A243360(n) = 987654321. - _Jaroslav Krizek_, Jun 19 2014
%H A160402 Nathaniel Johnston, <a href="/A160402/b160402.txt">Table of n, a(n) for n = 1..3098</a> (full sequence)
%p A160402 A160402:={}: p:=23456789: while p<=98765432 do d:=convert(p,base,10): ddig:=true: for k from 0 to 9 do if((k<=1 and numboccur(k,d)>0) or (k>=2 and numboccur(k,d)<>1))then ddig:=false:break: fi: od: if(ddig)then A160402:=A160402 union {p}: fi: p:=nextprime(p): od: op(sort(convert(A160402,list))); # _Nathaniel Johnston_, Jun 24 2011
%o A160402 (Magma) [n: n in [1..100000000] | Seqint(Sort(&cat[(Intseq(k)): k in Divisors(n)])) eq 987654321] // _Jaroslav Krizek_, Jun 19 2014
%Y A160402 Cf. A029743, A106116. Subsequence of A074665.
%K A160402 nonn,fini,full,base
%O A160402 1,1
%A A160402 _Lekraj Beedassy_, May 13 2009
%E A160402 Keywords "base,fini" added by _R. J. Mathar_, May 14 2009