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.

A141405 Smallest n-digit prime using the most distinct and consecutive digits.

This page as a plain text file.
%I A141405 #2 Mar 31 2012 10:26:07
%S A141405 2,23,101,1423,10243,102043,1234657,10243567,100234657,1123465789,
%T A141405 10123457689,100123456789,1001233458679,10011223456879,
%U A141405 100122334546789,1001122334546879
%N A141405 Smallest n-digit prime using the most distinct and consecutive digits.
%e A141405 a(10)=1123465789 and not 1002430567 because although the latter prime is smaller it does not have the most distinct digits. Similarly,a(13)= 1001233458679 and not 1001123456897. Note that for n >=11,all digits 0 through 9 are used.
%Y A141405 Cf. A007809 [From _Lekraj Beedassy_, Sep 14 2008]
%K A141405 more,nonn,base
%O A141405 1,1
%A A141405 _Lekraj Beedassy_, Aug 03 2008, Aug 09 2008