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.

A234247 Triangle T(n,k) read by rows: Number of non-equivalent ways (mod D_3) to choose k points from an nXnXn triangular grid so that no three of them form a 2X2X2 subtriangle.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 4
6 4
7 2
8 3
9 10
10 22
11 31
12 22
13 10
14 1
15 4
16 22
17 82
18 212
19 374
20 450
21 342
22 156
23 36
24 2
25 5
26 41
27 231
28 955
29 2880
30 6459
31 10660
32 12948
33 11274
34 6802
35 2645
36 595
37 57
38 2
39 7
40 72
41 566
42 3335
43 14883
44 51470
45 139224
46 297048
47 500147
48 661796
49 681101
50 536322
51 314753
52 132490

List of values

[1, 1, 1, 2, 4, 4, 2, 3, 10, 22, 31, 22, 10, 1, 4, 22, 82, 212, 374, 450, 342, 156, 36, 2, 5, 41, 231, 955, 2880, 6459, 10660, 12948, 11274, 6802, 2645, 595, 57, 2, 7, 72, 566, 3335, 14883, 51470, 139224, 297048, 500147, 661796, 681101, 536322, 314753, 132490]