The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1

%I #5 Mar 31 2012 13:22:04

%S 0,0,61,61,6861,106881,806881,688611,6088861,169111,6601911,810681,

%T 1161,10086091,6096691,1016101,69088101,16106811,60088191,8608611,

%U 6008001,66169881,160161601,106898181,689060101,1811106801

%N 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 P. CAMI, <a href="/A122568/b122568.txt">Table of n, a(n) for n=1..99</a>

%e 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 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 Cf. A048895.

%K base,nonn

%O 1,3

%A _Pierre CAMI_, Sep 21 2006, corrected Sep 27 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 9 16:40 EDT 2023. Contains 363183 sequences. (Running on oeis4.)