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.

A349944 a (1) = 1; a(n) is the smallest number not yet present in the sequence such that the concatenation of a(n-1) and a(n) contains three consecutive descending digits d > e > f.

Table of values

n a(n)
1 1
2 210
3 2
4 10
5 310
6 3
7 20
8 320
9 4
10 21
11 321
12 5
13 30
14 410
15 6
16 31
17 420
18 7
19 32
20 11
21 421
22 8
23 40
24 430
25 9
26 41
27 431
28 12
29 100
30 432
31 13
32 101
33 510
34 14
35 102
36 103
37 104
38 105
39 42
40 15
41 43
42 16
43 50
44 520
45 17
46 51
47 521
48 18
49 52
50 19
51 53
52 22
53 106
54 54
55 23
56 107
57 60
58 530
59 24
60 108
61 61

List of values

[1, 210, 2, 10, 310, 3, 20, 320, 4, 21, 321, 5, 30, 410, 6, 31, 420, 7, 32, 11, 421, 8, 40, 430, 9, 41, 431, 12, 100, 432, 13, 101, 510, 14, 102, 103, 104, 105, 42, 15, 43, 16, 50, 520, 17, 51, 521, 18, 52, 19, 53, 22, 106, 54, 23, 107, 60, 530, 24, 108, 61]