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.

A363370 Number of ways to distribute n guards on the corners and walls of a square castle so that each wall has an equal number of guards modulo rotations and reflections.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 3
5 2
6 5
7 4
8 9
9 8
10 13
11 13
12 22
13 20
14 30
15 31
16 44
17 44
18 60
19 61
20 82
21 84
22 106
23 111
24 141
25 144
26 177
27 186
28 225
29 234
30 279
31 291
32 345
33 360
34 417
35 438
36 508
37 528
38 604
39 634
40 720
41 752
42 848
43 886
44 996
45 1040
46 1156
47 1210
48 1345
49 1400
50 1545
51 1615
52 1775
53 1850
54 2025
55 2110

List of values

[1, 0, 1, 1, 3, 2, 5, 4, 9, 8, 13, 13, 22, 20, 30, 31, 44, 44, 60, 61, 82, 84, 106, 111, 141, 144, 177, 186, 225, 234, 279, 291, 345, 360, 417, 438, 508, 528, 604, 634, 720, 752, 848, 886, 996, 1040, 1156, 1210, 1345, 1400, 1545, 1615, 1775, 1850, 2025, 2110]