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.

A239215 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 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 22
20 23
21 24
22 25
23 26
24 27
25 28
26 29
27 33
28 34
29 35
30 36
31 37
32 38
33 39
34 44
35 45
36 46
37 47
38 48
39 49
40 55
41 56
42 57
43 58
44 59
45 66
46 67
47 68
48 69
49 77
50 78
51 79
52 88
53 89
54 99
55 999
56 9999
57 99999
58 999999
59 9999999
60 99999999

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 26, 27, 28, 29, 33, 34, 35, 36, 37, 38, 39, 44, 45, 46, 47, 48, 49, 55, 56, 57, 58, 59, 66, 67, 68, 69, 77, 78, 79, 88, 89, 99, 999, 9999, 99999, 999999, 9999999, 99999999]