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.

A114134 Start with a(1) = 1. For n>1, choose a(n) to be the smallest number > a(n-1) consistent with the condition that "the a(n)-th digit is a 1" is true for all n.

Table of values

n a(n)
1 1
2 3
3 10
4 11
5 12
6 21
7 110
8 111
9 112
10 113
11 114
12 115
13 116
14 117
15 118
16 119
17 120
18 121
19 122
20 123
21 124
22 125
23 126
24 127
25 128
26 129
27 130
28 131
29 132
30 133
31 134
32 135
33 136
34 137
35 138
36 139
37 140
38 141
39 142
40 1111
41 11111
42 111111
43 1111111
44 11111111
45 11111112
46 11111113

List of values

[1, 3, 10, 11, 12, 21, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 1111, 11111, 111111, 1111111, 11111111, 11111112, 11111113]