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.

A333774 a(0) = 0; for n > 0, a(n) = the smallest positive integer not yet appearing in the sequence such that a(n-1) + a(n) contains as a substring either a(n-1) or a(n).

Table of values

n a(n)
0 0
1 1
2 9
3 10
4 2
5 18
6 100
7 3
8 20
9 4
10 30
11 5
12 40
13 6
14 50
15 7
16 60
17 8
18 70
19 200
20 11
21 99
22 300
23 12
24 108
25 972
26 107
27 963
28 106
29 954
30 105
31 945
32 104
33 936
34 103
35 927
36 102
37 918
38 101
39 909
40 1000
41 13
42 117
43 1053
44 116
45 1044
46 115
47 1035
48 114
49 1026
50 113
51 1017
52 112
53 1008
54 111
55 999
56 110
57 990
58 109
59 981
60 2000
61 14

List of values

[0, 1, 9, 10, 2, 18, 100, 3, 20, 4, 30, 5, 40, 6, 50, 7, 60, 8, 70, 200, 11, 99, 300, 12, 108, 972, 107, 963, 106, 954, 105, 945, 104, 936, 103, 927, 102, 918, 101, 909, 1000, 13, 117, 1053, 116, 1044, 115, 1035, 114, 1026, 113, 1017, 112, 1008, 111, 999, 110, 990, 109, 981, 2000, 14]