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.

0, 0, 61, 61, 6861, 106881, 806881, 688611, 6088861, 169111, 6601911, 810681, 1161, 10086091, 6096691, 1016101, 69088101, 16106811, 60088191, 8608611, 6008001, 66169881, 160161601, 106898181, 689060101, 1811106801

Offset

1,3

Links

P. CAMI, Table of n, a(n) for n=1..99

Example

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
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

Crossrefs

Cf. A048895.

Sequence in context: A033381 A204748 A276471 * A075028 A379096 A258158

Adjacent sequences: A122565 A122566 A122567 * A122569 A122570 A122571

Keyword

base,nonn

Author

Pierre CAMI, Sep 21 2006, corrected Sep 27 2006

Status

approved