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.

A052983 Least multiple of n consisting of a succession of 1's followed by a succession of 0's.

Table of values

n a(n)
1 10
2 10
3 1110
4 100
5 10
6 1110
7 1111110
8 1000
9 1111111110
10 10
11 110
12 11100
13 1111110
14 1111110
15 1110
16 10000
17 11111111111111110
18 1111111110
19 1111111111111111110
20 100
21 1111110
22 110
23 11111111111111111111110
24 111000
25 100
26 1111110
27 1111111111111111111111111110

List of values

[10, 10, 1110, 100, 10, 1110, 1111110, 1000, 1111111110, 10, 110, 11100, 1111110, 1111110, 1110, 10000, 11111111111111110, 1111111110, 1111111111111111110, 100, 1111110, 110, 11111111111111111111110, 111000, 100, 1111110, 1111111111111111111111111110]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.