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.

A244500 Number T(n, k) of ways to place k points on an n X n X n triangular grid so that no pair of them has distance sqrt(3). Triangle read by rows.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 3
6 1
7 1
8 6
9 12
10 8
11 1
12 10
13 36
14 55
15 33
16 9
17 1
18 15
19 87
20 248
21 378
22 339
23 187
24 63
25 12
26 1
27 1
28 21
29 180
30 820
31 2190
32 3606
33 3716
34 2340
35 825
36 125
37 1
38 28
39 333
40 2212
41 9110
42 24474
43 43928
44 53018
45 42774
46 22792
47 7945
48 1764
49 196
50 1
51 36
52 567
53 5163
54 30300
55 121077
56 339621

List of values

[1, 1, 1, 3, 3, 1, 1, 6, 12, 8, 1, 10, 36, 55, 33, 9, 1, 15, 87, 248, 378, 339, 187, 63, 12, 1, 1, 21, 180, 820, 2190, 3606, 3716, 2340, 825, 125, 1, 28, 333, 2212, 9110, 24474, 43928, 53018, 42774, 22792, 7945, 1764, 196, 1, 36, 567, 5163, 30300, 121077, 339621]