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.

A333811 a(0) = 0; for n > 0, a(n) is 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 2
3 5
4 3
5 7
6 4
7 6
8 8
9 9
10 11
11 15
12 12
13 14
14 13
15 10
16 16
17 17
18 21
19 20
20 25
21 18
22 23
23 19
24 22
25 24
26 26
27 29
28 30
29 28
30 31
31 27
32 32
33 33
34 35
35 34
36 36
37 37
38 38
39 39
40 40
41 41
42 42
43 43
44 44
45 45
46 47
47 46
48 48
49 50
50 49
51 51
52 52
53 53
54 55
55 54
56 56
57 57
58 59
59 58
60 61
61 60
62 62
63 63
64 64
65 65
66 66
67 67
68 68
69 69
70 70

List of values

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