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.

A353449 T(n,m) is the number of non-congruent quadrilaterals with integer vertex coordinates (x1,1), (n,y2), (x3,m), (1,y4), 1 < x1, x3 < n, 1 < y2, y4 < m, m <= n, such that the 6 distances between the 4 vertices are distinct and (x3-x1)*(y4-y2) > 0, where T(n,m) is a triangle read by rows.

Table of values

n a(n)
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 1
11 2
12 2
13 0
14 1
15 8
16 15
17 12
18 0
19 3
20 16
21 27
22 49
23 29
24 0
25 7
26 21
27 44
28 71
29 103
30 66
31 0
32 9
33 30
34 61
35 106
36 152
37 216
38 131
39 0
40 13
41 41
42 80
43 145
44 213
45 298
46 404
47 245
48 0
49 17
50 55
51 106
52 189
53 279
54 383
55 507
56 677
57 373
58 0
59 22
60 69
61 135
62 228
63 345
64 485
65 641
66 848
67 1054
68 576

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 0, 1, 8, 15, 12, 0, 3, 16, 27, 49, 29, 0, 7, 21, 44, 71, 103, 66, 0, 9, 30, 61, 106, 152, 216, 131, 0, 13, 41, 80, 145, 213, 298, 404, 245, 0, 17, 55, 106, 189, 279, 383, 507, 677, 373, 0, 22, 69, 135, 228, 345, 485, 641, 848, 1054, 576]