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.

A239572 Triangle T(n, k) = Numbers of non-equivalent (mod D_3) ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 1
6 3
7 6
8 6
9 1
10 4
11 16
12 32
13 24
14 7
15 1
16 5
17 32
18 113
19 200
20 176
21 66
22 6
23 7
24 60
25 329
26 1053
27 1976
28 2096
29 1162
30 302
31 34
32 2
33 8
34 100
35 790
36 3932
37 12565
38 25676
39 32963
40 25638
41 11294
42 2493
43 222
44 7
45 10
46 160
47 1702
48 11988
49 57275
50 187984
51 425329
52 658608
53 684671
54 462519

List of values

[1, 1, 2, 2, 1, 3, 6, 6, 1, 4, 16, 32, 24, 7, 1, 5, 32, 113, 200, 176, 66, 6, 7, 60, 329, 1053, 1976, 2096, 1162, 302, 34, 2, 8, 100, 790, 3932, 12565, 25676, 32963, 25638, 11294, 2493, 222, 7, 10, 160, 1702, 11988, 57275, 187984, 425329, 658608, 684671, 462519]