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.

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.

Table of values

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

List of values

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