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.

A333775 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 6
4 4
5 10
6 3
7 5
8 7
9 11
10 8
11 16
12 20
13 21
14 9
15 22
16 51
17 12
18 26
19 24
20 52
21 76
22 28
23 46
24 40
25 31
26 30
27 41
28 15
29 50
30 13
31 25
32 17
33 69
34 34
35 42
36 94
37 100
38 14
39 82
40 71
41 60
42 36
43 38
44 89
45 55
46 61
47 35
48 80
49 56
50 87
51 33
52 75
53 29
54 53
55 101
56 18
57 66
58 151
59 32
60 91
61 43
62 102
63 19
64 63
65 137
66 83
67 96
68 126
69 44
70 59
71 27
72 103

List of values

[0, 1, 2, 6, 4, 10, 3, 5, 7, 11, 8, 16, 20, 21, 9, 22, 51, 12, 26, 24, 52, 76, 28, 46, 40, 31, 30, 41, 15, 50, 13, 25, 17, 69, 34, 42, 94, 100, 14, 82, 71, 60, 36, 38, 89, 55, 61, 35, 80, 56, 87, 33, 75, 29, 53, 101, 18, 66, 151, 32, 91, 43, 102, 19, 63, 137, 83, 96, 126, 44, 59, 27, 103]