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.

A338664 a(n) is the number of ways that n square tiles can be formed into two rectangles, such that those rectangles fit orthogonally into the minimal bounding square that can contain n such tiles, without overlap.

Table of values

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

List of values

[0, 1, 1, 1, 2, 2, 2, 1, 1, 4, 2, 4, 2, 2, 1, 2, 4, 4, 4, 4, 3, 2, 2, 1, 2, 6, 5, 6, 2, 7, 2, 3, 2, 2, 1, 3, 6, 6, 6, 5, 4, 6, 4, 2, 3, 2, 2, 1, 3, 8, 4, 10, 4, 6, 3, 9, 2, 4, 2, 3, 2, 2, 1, 4, 5, 10, 6, 6, 8, 4, 4, 9, 4, 2]