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.

A096771 Triangle read by rows: T(n,m) is the number of partitions of n that (just) fit inside an m X m box, but not in an (m-1) X (m-1) box. Partitions of n with Max(max part, length) = m.

Table of values

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

List of values

[1, 0, 2, 0, 1, 2, 0, 1, 2, 2, 0, 0, 3, 2, 2, 0, 0, 3, 4, 2, 2, 0, 0, 2, 5, 4, 2, 2, 0, 0, 1, 7, 6, 4, 2, 2, 0, 0, 1, 6, 9, 6, 4, 2, 2, 0, 0, 0, 7, 11, 10, 6, 4, 2, 2, 0, 0, 0, 5, 14, 13, 10, 6, 4, 2, 2, 0, 0, 0, 5, 15, 19, 14, 10, 6, 4, 2, 2, 0, 0, 0, 3, 17, 22, 21, 14, 10, 6, 4, 2, 2, 0, 0, 0, 2, 17, 29]