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.

A351701 Smallest maximum of the distinct squared distances between any two of the points taken over all possible solutions, written as triangle T(n,k) with problem size and number of points given by the corresponding A351700.

Table of values

n a(n)
1 0
2 1
3 2
4 4
5 5
6 8
7 9
8 10
9 10
10 13
11 16
12 16
13 16
14 20
15 20
16 25
17 25
18 26
19 25
20 25
21 41
22 36
23 36
24 36
25 40
26 37
27 37
28 72
29 49
30 49
31 49
32 49
33 58
34 50
35 50
36 52
37 64
38 64
39 64
40 64
41 64
42 64
43 73
44 80
45 74
46 81
47 81
48 81
49 81
50 81
51 90
52 82
53 82
54 100
55 113
56 100
57 100
58 100
59 100
60 109
61 100
62 100
63 109
64 106
65 104
66 149

List of values

[0, 1, 2, 4, 5, 8, 9, 10, 10, 13, 16, 16, 16, 20, 20, 25, 25, 26, 25, 25, 41, 36, 36, 36, 40, 37, 37, 72, 49, 49, 49, 49, 58, 50, 50, 52, 64, 64, 64, 64, 64, 64, 73, 80, 74, 81, 81, 81, 81, 81, 90, 82, 82, 100, 113, 100, 100, 100, 100, 109, 100, 100, 109, 106, 104, 149]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.