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.

A368559 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier such that a(n) contains all the distinct digits of a(n-1) - a(n-2).

Table of values

n a(n)
1 1
2 2
3 10
4 8
5 12
6 4
7 18
8 14
9 24
10 100
11 67
12 3
13 46
14 34
15 21
16 13
17 28
18 15
19 31
20 16
21 51
22 35
23 61
24 26
25 53
26 27
27 62
28 135
29 37
30 89
31 25
32 64
33 39
34 52
35 103
36 105
37 20
38 58
39 38
40 102
41 146
42 40
43 106
44 6
45 101
46 59
47 42
48 17
49 125
50 108
51 71
52 73
53 22
54 115
55 93
56 23
57 70
58 47
59 32
60 145
61 113
62 123
63 104
64 19
65 85
66 36
67 49
68 130
69 81
70 94

List of values

[1, 2, 10, 8, 12, 4, 18, 14, 24, 100, 67, 3, 46, 34, 21, 13, 28, 15, 31, 16, 51, 35, 61, 26, 53, 27, 62, 135, 37, 89, 25, 64, 39, 52, 103, 105, 20, 58, 38, 102, 146, 40, 106, 6, 101, 59, 42, 17, 125, 108, 71, 73, 22, 115, 93, 23, 70, 47, 32, 145, 113, 123, 104, 19, 85, 36, 49, 130, 81, 94]