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.

A384208 a(n) is the number of ways to partition a square n X n into five rectangles of different dimensions, without any straight cut spanning the entire square.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 4
6 15
7 39
8 88
9 162
10 283
11 450
12 691
13 1005
14 1425
15 1954
16 2626
17 3444
18 4452
19 5652
20 7094
21 8775
22 10755
23 13035
24 15676
25 18679
26 22053
27 25819
28 29967
29 34543
30 39531
31 44976
32 50878
33 57231
34 64026
35 71296
36 79026
37 87243
38 95920
39 105036
40 114590
41 124672
42 135206
43 146231
44 157684
45 169642
46 182051
47 194927
48 208298
49 222125
50 236484

List of values

[0, 0, 0, 1, 4, 15, 39, 88, 162, 283, 450, 691, 1005, 1425, 1954, 2626, 3444, 4452, 5652, 7094, 8775, 10755, 13035, 15676, 18679, 22053, 25819, 29967, 34543, 39531, 44976, 50878, 57231, 64026, 71296, 79026, 87243, 95920, 105036, 114590, 124672, 135206, 146231, 157684, 169642, 182051, 194927, 208298, 222125, 236484]