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.

A327762 a(n) = smallest positive number not already in the sequence such that all n(n+1)/2 numbers in the triangle of differences of the first n terms are distinct.

Table of values

n a(n)
1 1
2 3
3 9
4 5
5 12
6 10
7 23
8 8
9 22
10 17
11 42
12 16
13 43
14 20
15 38
16 26
17 45
18 32
19 65
20 28
21 64
22 39
23 76
24 34
25 81
26 48
27 98
28 40
29 92
30 54
31 109
32 60
33 116
34 51
35 114
36 58
37 117
38 70
39 136
40 67
41 135
42 71
43 145
44 72
45 147
46 69
47 146
48 80
49 164
50 87
51 166
52 82
53 170
54 108
55 198
56 99

List of values

[1, 3, 9, 5, 12, 10, 23, 8, 22, 17, 42, 16, 43, 20, 38, 26, 45, 32, 65, 28, 64, 39, 76, 34, 81, 48, 98, 40, 92, 54, 109, 60, 116, 51, 114, 58, 117, 70, 136, 67, 135, 71, 145, 72, 147, 69, 146, 80, 164, 87, 166, 82, 170, 108, 198, 99]