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.

A244859 Least positive multiple of n which when written in base 10 is either a repunit or of the form 111...000.

Table of values

n a(n)
0 0
1 1
2 10
3 111
4 100
5 10
6 1110
7 111111
8 1000
9 111111111
10 10
11 11
12 11100
13 111111
14 1111110
15 1110
16 10000
17 1111111111111111
18 1111111110
19 111111111111111111
20 100
21 111111
22 110
23 1111111111111111111111
24 111000
25 100
26 1111110
27 111111111111111111111111111
28 11111100

List of values

[0, 1, 10, 111, 100, 10, 1110, 111111, 1000, 111111111, 10, 11, 11100, 111111, 1111110, 1110, 10000, 1111111111111111, 1111111110, 111111111111111111, 100, 111111, 110, 1111111111111111111111, 111000, 100, 1111110, 111111111111111111111111111, 11111100]