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.

A210570 Consider all sequences of n distinct positive integers for which no two different elements have a difference which is a square. This sequence gives the smallest maximal integer in such sequences.

Table of values

n a(n)
1 1
2 3
3 6
4 8
5 11
6 13
7 16
8 18
9 21
10 23
11 35
12 38
13 43
14 48
15 53
16 58
17 66
18 68
19 71
20 73
21 81
22 86
23 92
24 97
25 102
26 107
27 112
28 118
29 120
30 125
31 131
32 133
33 138
34 144
35 146
36 151
37 157
38 159
39 164
40 189
41 199
42 203
43 206
44 208
45 219
46 223
47 236
48 242
49 248
50 253
51 258
52 263
53 266
54 269
55 283
56 285
57 288
58 293
59 311
60 314
61 323
62 328
63 331
64 334
65 343
66 346

List of values

[1, 3, 6, 8, 11, 13, 16, 18, 21, 23, 35, 38, 43, 48, 53, 58, 66, 68, 71, 73, 81, 86, 92, 97, 102, 107, 112, 118, 120, 125, 131, 133, 138, 144, 146, 151, 157, 159, 164, 189, 199, 203, 206, 208, 219, 223, 236, 242, 248, 253, 258, 263, 266, 269, 283, 285, 288, 293, 311, 314, 323, 328, 331, 334, 343, 346]