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.

A336285 a(0) = 0; for n > 0, a(n) is the least positive integer not occurring earlier such that 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 11
12 12
13 13
14 14
15 15
16 16
17 18
18 17
19 19
20 20
21 21
22 22
23 23
24 24
25 25
26 26
27 27
28 29
29 28
30 30
31 31
32 32
33 33
34 34
35 35
36 36
37 37
38 38
39 40
40 39
41 41
42 42
43 43
44 44
45 45
46 46
47 47
48 48
49 49
50 53
51 50
52 52
53 51
54 54
55 55
56 65
57 58
58 62
59 61
60 59
61 64
62 56
63 67
64 57
65 63
66 60
67 66
68 68
69 69
70 70
71 72
72 71
73 74
74 73
75 75
76 77

List of values

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