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.

A234350 Triangle T(n, k) = Number of non-equivalent (mod D_3) ways to arrange k indistinguishable points on a triangular grid of side n so that no three points are collinear. Triangle read by rows.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 4
7 5
8 2
9 3
10 10
11 22
12 24
13 8
14 1
15 4
16 22
17 77
18 153
19 140
20 47
21 2
22 5
23 41
24 217
25 713
26 1290
27 1112
28 322
29 15
30 7
31 72
32 530
33 2557
34 7374
35 11743
36 8783
37 2412
38 143
39 1
40 8
41 116
42 1149
43 7661
44 32477
45 82988
46 116154
47 77690
48 19621
49 1220
50 5
51 10
52 180
53 2288
54 20055
55 116420
56 433372

List of values

[1, 1, 1, 1, 2, 4, 5, 2, 3, 10, 22, 24, 8, 1, 4, 22, 77, 153, 140, 47, 2, 5, 41, 217, 713, 1290, 1112, 322, 15, 7, 72, 530, 2557, 7374, 11743, 8783, 2412, 143, 1, 8, 116, 1149, 7661, 32477, 82988, 116154, 77690, 19621, 1220, 5, 10, 180, 2288, 20055, 116420, 433372]