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.

A182114 Number of partitions of n with largest inscribed rectangle having area <= k; triangle T(n,k), 0<=n, 0<=k<=n, read by rows.

Table of values

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

List of values

[1, 0, 1, 0, 0, 2, 0, 0, 1, 3, 0, 0, 0, 2, 5, 0, 0, 0, 1, 5, 7, 0, 0, 0, 0, 5, 7, 11, 0, 0, 0, 0, 3, 7, 13, 15, 0, 0, 0, 0, 1, 5, 16, 18, 22, 0, 0, 0, 0, 0, 3, 17, 21, 27, 30, 0, 0, 0, 0, 0, 1, 16, 22, 34, 38, 42, 0, 0, 0, 0, 0, 0, 13, 21, 39, 48, 54, 56]