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.

A283113 Triangle read by rows: T(n,k) is the number of nonequivalent ways (mod D_3) to place k points on an n X n X n triangular grid so that no two of them are on the same row, column or diagonal (n >= 1).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 2
7 1
8 1
9 3
10 3
11 1
12 1
13 4
14 9
15 5
16 1
17 5
18 19
19 23
20 3
21 1
22 7
23 38
24 82
25 40
26 1
27 1
28 8
29 66
30 230
31 242
32 45
33 1
34 10
35 110
36 560
37 1038
38 533
39 29
40 1
41 12
42 170
43 1208
44 3504
45 3546
46 821
47 6
48 1
49 14
50 255
51 2392
52 9998
53 16917
54 9137
55 807
56 1
57 16
58 365
59 4405
60 25158
61 64345
62 63755
63 17408
64 422

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 9, 5, 1, 5, 19, 23, 3, 1, 7, 38, 82, 40, 1, 1, 8, 66, 230, 242, 45, 1, 10, 110, 560, 1038, 533, 29, 1, 12, 170, 1208, 3504, 3546, 821, 6, 1, 14, 255, 2392, 9998, 16917, 9137, 807, 1, 16, 365, 4405, 25158, 64345, 63755, 17408, 422]