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.

A330430 Consider integers k=0,1,2,... as strings. Compare each digit in the string, in left-to-right order, with the contents of a bag (multiset) of digits, which is initially empty. If digit d is in the bag delete d from both the string and the bag. What remains of any nonempty string is appended to the sequence and its digits are added to the bag.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 5
7 6
8 7
9 8
10 9
11 11
12 1
13 1
14 1
15 20
16 1
17 22
18 3
19 4
20 25
21 6
22 27
23 8
24 29
25 3
26 33
27 3
28 3
29 40
30 1
31 42
32 3
33 44
34 5
35 6
36 47
37 8
38 49
39 5
40 5
41 55
42 5
43 60
44 1
45 62
46 3
47 64
48 5
49 66
50 7
51 8
52 69
53 7
54 7
55 7
56 77
57 80
58 1
59 82
60 3
61 84
62 5
63 86
64 7
65 88
66 9
67 9
68 9
69 9
70 9
71 99
72 100
73 1
74 2
75 103
76 4
77 105

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 1, 1, 1, 20, 1, 22, 3, 4, 25, 6, 27, 8, 29, 3, 33, 3, 3, 40, 1, 42, 3, 44, 5, 6, 47, 8, 49, 5, 5, 55, 5, 60, 1, 62, 3, 64, 5, 66, 7, 8, 69, 7, 7, 7, 77, 80, 1, 82, 3, 84, 5, 86, 7, 88, 9, 9, 9, 9, 9, 99, 100, 1, 2, 103, 4, 105]