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.

A342383 a(0) = 0; for n > 0, a(n) is the least positive integer not occurring earlier such that both the digits in a(n) and the digits in a(n-1)+a(n) are all distinct.

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 7, 6, 8, 9, 10, 13, 12, 14, 15, 16, 18, 17, 19, 20, 21, 24, 23, 25, 26, 27, 29, 28, 30, 31, 32, 35, 34, 36, 37, 38, 40, 39, 41, 42, 43, 46, 45, 47, 48, 49, 53, 50, 52, 51, 54, 69, 56, 64, 59, 61, 62, 58, 65, 60, 63, 57, 67, 68, 70, 72, 71, 74, 73, 75, 78, 76, 80, 79, 81, 82, 83]