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.

A186705 The Erdős unit distance problem: the maximum number of occurrences of the same distance among n points in the plane.

Table of values

n a(n)
1 0
2 1
3 3
4 5
5 7
6 9
7 12
8 14
9 18
10 20
11 23
12 27
13 30
14 33
15 37
16 41
17 43
18 46
19 50
20 54
21 57

List of values

[0, 1, 3, 5, 7, 9, 12, 14, 18, 20, 23, 27, 30, 33, 37, 41, 43, 46, 50, 54, 57]