cp's OEIS Frontend

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.

A159757 Pandigital primes with the fewest duplicate digits, starting with the largest and listed in descending order.

This page as a plain text file.
%I A159757 #8 Jun 04 2018 17:54:01
%S A159757 98876532401,98876530421,98876524301,98876524013,98876520143,
%T A159757 98876504123,98876502143,98876421053,98876405231,98876342501,
%U A159757 98876320451,98876304251,98876254031,98876254013,98876251043
%N A159757 Pandigital primes with the fewest duplicate digits, starting with the largest and listed in descending order.
%H A159757 Robert Israel, <a href="/A159757/b159757.txt">Table of n, a(n) for n = 1..68476</a>
%p A159757 # This program produces all 68476 pandigital primes of length 11 starting with 98, although only the first 100 are displayed.
%p A159757 R:= map(op,[seq(combinat:-permute([$0..7,i]),i=[1,2,4,5,7,8])]):
%p A159757 R:= map(t -> 98*10^9+add(t[i]*10^(i-1),i=1..9), R):
%p A159757 A:= sort(select(isprime,R),`>`):
%p A159757 A[1..100]; # _Robert Israel_, Jun 04 2018
%Y A159757 Cf. A159474
%K A159757 nonn,base,fini
%O A159757 1,1
%A A159757 _Lekraj Beedassy_, Apr 21 2009
%E A159757 Extended by _Ray Chandler_, Apr 22 2009