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.

A004286 Least positive multiple of n written in base 6 using only 0 and 1.

Table of values

n a(n)
1 1
2 10
3 10
4 100
5 11111
6 10
7 11
8 1000
9 100
10 111110
11 1101
12 100
13 10111
14 110
15 111110
16 10000
17 11001
18 100
19 101011
20 1111100
21 110
22 11010
23 1101
24 1000
25 111101
26 101110
27 1000
28 1100
29 1010111
30 111110
31 1001
32 100000
33 11010
34 110010
35 1111111111
36 100
37 101
38 1010110
39 101110
40 11111000

List of values

[1, 10, 10, 100, 11111, 10, 11, 1000, 100, 111110, 1101, 100, 10111, 110, 111110, 10000, 11001, 100, 101011, 1111100, 110, 11010, 1101, 1000, 111101, 101110, 1000, 1100, 1010111, 111110, 1001, 100000, 11010, 110010, 1111111111, 100, 101, 1010110, 101110, 11111000]

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

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