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.

A167262 T(n,m) = Number of ways to partition an nXm grid into 6 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 1
9 1
10 0
11 0
12 0
13 0
14 0
15 0
16 1
17 0
18 11
19 11
20 0
21 1
22 0
23 13
24 0
25 0
26 0
27 13
28 0
29 0
30 0
31 170
32 0
33 0
34 170
35 0
36 0
37 0
38 0
39 0
40 2003
41 0
42 2003
43 0
44 0
45 0
46 0
47 41
48 997
49 0
50 27950
51 27950
52 0
53 997
54 41
55 0
56 0
57 0
58 0
59 0
60 0
61 451206
62 0
63 0
64 0
65 0
66 0
67 1
68 0
69 7670
70 244252
71 0
72 6633399
73 6633399
74 0
75 244252
76 7670
77 0

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 11, 11, 0, 1, 0, 13, 0, 0, 0, 13, 0, 0, 0, 170, 0, 0, 170, 0, 0, 0, 0, 0, 2003, 0, 2003, 0, 0, 0, 0, 41, 997, 0, 27950, 27950, 0, 997, 41, 0, 0, 0, 0, 0, 0, 451206, 0, 0, 0, 0, 0, 1, 0, 7670, 244252, 0, 6633399, 6633399, 0, 244252, 7670, 0]