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.

A329447 Start with a(0)=0; thereafter, look left and identify the least frequent digit d so far (in case of a tie, choose the smallest d): after then a(n) = 10c + d, where c > 0 is the number of times d has appeared so far.

Table of values

n a(n)
0 0
1 10
2 11
3 20
4 12
5 22
6 30
7 13
8 23
9 33
10 40
11 14
12 24
13 34
14 44
15 50
16 15
17 25
18 35
19 45
20 55
21 60
22 16
23 26
24 36
25 46
26 56
27 66
28 70
29 17
30 27
31 37
32 47
33 57
34 67
35 77
36 80
37 18
38 28
39 38
40 48
41 58
42 68
43 78
44 88
45 90
46 19
47 29
48 39
49 49
50 59
51 69
52 79
53 89
54 99
55 100
56 112
57 113
58 114
59 115
60 116
61 117
62 118
63 119
64 120
65 123
66 124
67 125
68 126
69 127
70 128
71 129

List of values

[0, 10, 11, 20, 12, 22, 30, 13, 23, 33, 40, 14, 24, 34, 44, 50, 15, 25, 35, 45, 55, 60, 16, 26, 36, 46, 56, 66, 70, 17, 27, 37, 47, 57, 67, 77, 80, 18, 28, 38, 48, 58, 68, 78, 88, 90, 19, 29, 39, 49, 59, 69, 79, 89, 99, 100, 112, 113, 114, 115, 116, 117, 118, 119, 120, 123, 124, 125, 126, 127, 128, 129]