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.

A338671 a(n) is the number of distinct ways of arranging n identical square tiles into two rectangles.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 3
6 4
7 5
8 7
9 7
10 10
11 10
12 13
13 14
14 16
15 16
16 21
17 20
18 25
19 24
20 29
21 28
22 34
23 30
24 40
25 36
26 43
27 40
28 50
29 44
30 55
31 49
32 60
33 55
34 66
35 55
36 75
37 64
38 75
39 70
40 86
41 72
42 92
43 77
44 97
45 87
46 103
47 84
48 116
49 94
50 114
51 104
52 126
53 102
54 135
55 109
56 138
57 123
58 143
59 117
60 164
61 128
62 153
63 138
64 171

List of values

[0, 1, 1, 2, 3, 4, 5, 7, 7, 10, 10, 13, 14, 16, 16, 21, 20, 25, 24, 29, 28, 34, 30, 40, 36, 43, 40, 50, 44, 55, 49, 60, 55, 66, 55, 75, 64, 75, 70, 86, 72, 92, 77, 97, 87, 103, 84, 116, 94, 114, 104, 126, 102, 135, 109, 138, 123, 143, 117, 164, 128, 153, 138, 171]