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.

A362815 Start with 2. Then, numbers are added to the sequence if they do not form any arithmetic progression p with numbers in the sequence such that length(p) > min(p).

Table of values

n a(n)
1 2
2 3
3 5
4 6
5 7
6 11
7 13
8 14
9 16
10 17
11 18
12 19
13 21
14 22
15 23
16 25
17 28
18 29
19 31
20 37
21 38
22 39
23 41
24 43
25 46
26 47
27 50
28 51
29 52
30 53
31 55
32 58
33 59
34 61
35 62
36 64
37 66
38 67
39 68
40 70
41 71
42 73
43 75
44 77
45 79
46 82
47 83
48 85
49 86
50 88
51 89
52 93
53 94
54 96
55 97
56 99
57 101
58 103
59 106
60 107
61 109
62 110
63 113
64 115

List of values

[2, 3, 5, 6, 7, 11, 13, 14, 16, 17, 18, 19, 21, 22, 23, 25, 28, 29, 31, 37, 38, 39, 41, 43, 46, 47, 50, 51, 52, 53, 55, 58, 59, 61, 62, 64, 66, 67, 68, 70, 71, 73, 75, 77, 79, 82, 83, 85, 86, 88, 89, 93, 94, 96, 97, 99, 101, 103, 106, 107, 109, 110, 113, 115]