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.

A230505 T(n,k,s) is the number of parts of each size in the set of partitions of an n X k rectangle into integer-sided squares with side s, considering only the list of parts; irregular triangle T(n,k,s), n >= k >= s >= 1, read by rows.

Table of values

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

List of values

[1, 2, 4, 1, 3, 8, 1, 14, 1, 1, 4, 12, 3, 27, 3, 1, 47, 10, 1, 1, 5, 18, 3, 41, 4, 2, 85, 13, 3, 1, 134, 16, 4, 1, 1, 6, 24, 6, 62, 7, 4, 135, 27, 5, 3, 250, 40, 13, 3, 1, 415, 82, 24, 6, 1, 1, 7, 32, 6, 87, 9, 5, 204, 34, 8, 4, 381, 53, 18, 5, 3, 717, 127, 45, 13, 4, 1]