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.

A239090 The sequence S = a(1), a(2), ... is defined by a(1)=1, if d,e,f are consecutive digits then we do not have d >= e < f, and S is always extended with the smallest integer not yet present in S.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 11
11 111
12 1111
13 11111
14 111111
15 1111111
16 11111111
17 111111111
18 1111111111
19 11111111111
20 111111111111
21 1111111111111
22 11111111111111
23 111111111111111
24 1111111111111111
25 11111111111111111
26 111111111111111111

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 11111111111111111, 111111111111111111]