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.

A277057 Least k such that n-th repunit times k contains all digits from 1 to 9.

Table of values

n a(n)
1 123456789
2 11225079
3 1113198
4 210789
5 11115
6 11115
7 11115
8 11115
9 11115
10 11115
11 11115
12 11115
13 11115
14 11115
15 11115
16 11115
17 11115
18 11115
19 11115
20 11115
21 11115
22 11115
23 11115
24 11115
25 11115
26 11115
27 11115
28 11115
29 11115
30 11115
31 11115
32 11115
33 11115
34 11115
35 11115

List of values

[123456789, 11225079, 1113198, 210789, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115]