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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 1
12 0
13 0
14 0
15 1
16 0
17 8
18 0
19 0
20 8
21 0
22 0
23 0
24 62
25 0
26 62
27 0
28 0
29 0
30 0
31 0
32 454
33 454
34 0
35 0
36 0
37 0
38 0
39 0
40 0
41 4006
42 0
43 0
44 0
45 0
46 1
47 0
48 0
49 0
50 33344
51 33344
52 0
53 0
54 0
55 1
56 0
57 64
58 0
59 0
60 270827
61 0
62 270827
63 0
64 0
65 64
66 0
67 0
68 0
69 8072
70 0
71 2152050
72 0
73 0
74 2152050
75 0
76 8072
77 0
78 0
79 0
80 0
81 0

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 8, 0, 0, 8, 0, 0, 0, 62, 0, 62, 0, 0, 0, 0, 0, 454, 454, 0, 0, 0, 0, 0, 0, 0, 4006, 0, 0, 0, 0, 1, 0, 0, 0, 33344, 33344, 0, 0, 0, 1, 0, 64, 0, 0, 270827, 0, 270827, 0, 0, 64, 0, 0, 0, 8072, 0, 2152050, 0, 0, 2152050, 0, 8072, 0, 0, 0, 0, 0]