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.

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.

Terms

    a(0) =0a(1) =0a(2) =61a(3) =61a(4) =6861a(5) =106881a(6) =806881a(7) =688611a(8) =6088861a(9) =169111a(10) =6601911a(11) =810681a(12) =1161a(13) =10086091a(14) =6096691a(15) =1016101a(16) =69088101a(17) =16106811a(18) =60088191a(19) =8608611a(20) =6008001a(21) =66169881a(22) =160161601a(23) =106898181a(24) =689060101a(25) =1811106801

External references