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.

A110380 a(n) = min{p + q + r + ...} where p,q,r,... are distinct unary numbers - containing only ones, i.e., of the form (10^k - 1)/9 - formed by using a total of n ones.

Table of values

n a(n)
1 1
2 11
3 12
4 112
5 122
6 123
7 1123
8 1223
9 1233
10 1234
11 11234
12 12234
13 12334
14 12344
15 12345
16 112345
17 122345
18 123345
19 123445
20 123455
21 123456
22 1123456
23 1223456
24 1233456
25 1234456
26 1234556
27 1234566
28 1234567
29 11234567
30 12234567
31 12334567
32 12344567
33 12345567
34 12345667
35 12345677

List of values

[1, 11, 12, 112, 122, 123, 1123, 1223, 1233, 1234, 11234, 12234, 12334, 12344, 12345, 112345, 122345, 123345, 123445, 123455, 123456, 1123456, 1223456, 1233456, 1234456, 1234556, 1234566, 1234567, 11234567, 12234567, 12334567, 12344567, 12345567, 12345667, 12345677]