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.

A300761 Number of non-equivalent ways (mod D_2) to select 4 points from n equidistant points on a straight line so that no selected point is equally distant from two other selected points.

Table of values

n a(n)
4 0
5 1
6 3
7 6
8 15
9 28
10 53
11 87
12 140
13 210
14 310
15 434
16 600
17 803
18 1061
19 1368
20 1747
21 2190
22 2723
23 3337
24 4060
25 4884
26 5840
27 6916
28 8148
29 9525
30 11083
31 12810
32 14747
33 16880
34 19253
35 21851
36 24720
37 27846
38 31278
39 34998
40 39060
41 43447
42 48213
43 53340
44 58887
45 64834
46 71243
47 78093
48 85448

List of values

[0, 1, 3, 6, 15, 28, 53, 87, 140, 210, 310, 434, 600, 803, 1061, 1368, 1747, 2190, 2723, 3337, 4060, 4884, 5840, 6916, 8148, 9525, 11083, 12810, 14747, 16880, 19253, 21851, 24720, 27846, 31278, 34998, 39060, 43447, 48213, 53340, 58887, 64834, 71243, 78093, 85448]