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.

A279453 Triangle read by rows: T(n, k) is the number of nonequivalent ways to place k points on an n X n square grid so that no more than 2 points are on a vertical or horizontal straight line.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 1
9 3
10 8
11 14
12 17
13 9
14 2
15 1
16 3
17 21
18 73
19 202
20 306
21 285
22 115
23 20
24 1
25 6
26 49
27 301
28 1397
29 4361
30 9110
31 11810
32 8679
33 2929
34 288
35 1
36 6
37 93
38 890
39 6582
40 34059
41 126396
42 326190
43 568134
44 624875
45 390426
46 111798
47 8791
48 1
49 10
50 171
51 2321
52 24185
53 185181
54 1055025

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 3, 8, 14, 17, 9, 2, 1, 3, 21, 73, 202, 306, 285, 115, 20, 1, 6, 49, 301, 1397, 4361, 9110, 11810, 8679, 2929, 288, 1, 6, 93, 890, 6582, 34059, 126396, 326190, 568134, 624875, 390426, 111798, 8791, 1, 10, 171, 2321, 24185, 185181, 1055025]