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.

A167260 T(n,m) = Number of ways to partition an nXm grid into 4 connected equal-area regions.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 1
8 0
9 0
10 1
11 0
12 5
13 0
14 5
15 0
16 0
17 0
18 23
19 23
20 0
21 0
22 0
23 11
24 0
25 117
26 0
27 11
28 0
29 1
30 0
31 0
32 501
33 501
34 0
35 0
36 1
37 0
38 25
39 0
40 2369
41 0
42 2369
43 0
44 25
45 0
46 0
47 0
48 1038
49 9525
50 0
51 0
52 9525
53 1038
54 0
55 0
56 0
57 45
58 0
59 39731
60 0
61 442791
62 0
63 39731
64 0
65 45
66 0
67 1
68 0
69 0
70 145415
71 1596459
72 0
73 0
74 1596459

List of values

[0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 5, 0, 5, 0, 0, 0, 23, 23, 0, 0, 0, 11, 0, 117, 0, 11, 0, 1, 0, 0, 501, 501, 0, 0, 1, 0, 25, 0, 2369, 0, 2369, 0, 25, 0, 0, 0, 1038, 9525, 0, 0, 9525, 1038, 0, 0, 0, 45, 0, 39731, 0, 442791, 0, 39731, 0, 45, 0, 1, 0, 0, 145415, 1596459, 0, 0, 1596459]