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.

A353450 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 1
8 1
9 0
10 0
11 4
12 5
13 0
14 2
15 8
16 18
17 16
18 0
19 5
20 14
21 28
22 50
23 36
24 0
25 7
26 23
27 42
28 75
29 109
30 77
31 0
32 10
33 34
34 65
35 110
36 157
37 223
38 143
39 0
40 14
41 45
42 89
43 151
44 223
45 314
46 423
47 265
48 0
49 18
50 58
51 116
52 186
53 274
54 386
55 519
56 684
57 400
58 0
59 23
60 73
61 145
62 239
63 355
64 491
65 652
66 870
67 1069
68 622

List of values

[0, 0, 0, 0, 1, 1, 0, 0, 4, 5, 0, 2, 8, 18, 16, 0, 5, 14, 28, 50, 36, 0, 7, 23, 42, 75, 109, 77, 0, 10, 34, 65, 110, 157, 223, 143, 0, 14, 45, 89, 151, 223, 314, 423, 265, 0, 18, 58, 116, 186, 274, 386, 519, 684, 400, 0, 23, 73, 145, 239, 355, 491, 652, 870, 1069, 622]