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.

A354700 T(w,h) is the number of non-congruent quadrilaterals whose vertices with integer coordinates (x_i, y_i) all lie on the perimeter of a rectangle of width w and height h, with no 3 points on the same edge of the rectangle, max(x_i) - min(x_i) = w and max(y_i) - min(y_i) = h, such that the 6 distances between the 4 vertices are distinct.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 4
6 5
7 2
8 16
9 36
10 21
11 8
12 33
13 69
14 116
15 71
16 13
17 52
18 126
19 201
20 317
21 181
22 22
23 84
24 191
25 299
26 445
27 639
28 366
29 28
30 110
31 249
32 373
33 581
34 839
35 1105
36 585
37 43
38 157
39 330
40 529
41 806
42 1094
43 1463
44 1856
45 1009
46 50
47 190
48 407
49 653
50 1014
51 1360
52 1853
53 2295
54 2958
55 1562

List of values

[0, 0, 0, 1, 4, 5, 2, 16, 36, 21, 8, 33, 69, 116, 71, 13, 52, 126, 201, 317, 181, 22, 84, 191, 299, 445, 639, 366, 28, 110, 249, 373, 581, 839, 1105, 585, 43, 157, 330, 529, 806, 1094, 1463, 1856, 1009, 50, 190, 407, 653, 1014, 1360, 1853, 2295, 2958, 1562]