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 A122568 #5 Mar 31 2012 13:22:04 %S A122568 0,0,61,61,6861,106881,806881,688611,6088861,169111,6601911,810681, %T A122568 1161,10086091,6096691,1016101,69088101,16106811,60088191,8608611, %U A122568 6008001,66169881,160161601,106898181,689060101,1811106801 %N A122568 Least k (or 0 if no such k exists) such that 10^n+k is the least bemirp of a quartet of 4 different bemirps and the least bemirp of n+1 digits. %H A122568 P. CAMI, <a href="/A122568/b122568.txt">Table of n, a(n) for n=1..99</a> %e A122568 For n=3 10^3+61=1061, 1061, 1091, 1901, 1601 are 4 bemirps so a(3)=61 as 1061 is the least 4 digits prime like this %e A122568 For n=4 10^4+61=10061, 10061, 10091, 19001, 16001 are 4 bemirps so a(4)=61 as 10061 is the least 5 digits prime like this %Y A122568 Cf. A048895. %K A122568 base,nonn %O A122568 1,3 %A A122568 _Pierre CAMI_, Sep 21 2006, corrected Sep 27 2006