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.

A134979 Triangle read by rows: T(n,k) = number of partitions of n where the maximum number of objects in partitions of any given size is k.

Table of values

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

List of values

[1, 0, 2, 0, 1, 2, 0, 1, 1, 3, 0, 0, 3, 2, 2, 0, 0, 2, 4, 1, 4, 0, 0, 1, 6, 3, 3, 2, 0, 0, 1, 6, 4, 6, 1, 4, 0, 0, 0, 6, 7, 8, 3, 3, 3, 0, 0, 0, 5, 7, 14, 4, 6, 2, 4, 0, 0, 0, 5, 7, 18, 7, 9, 5, 3, 2, 0, 0, 0, 3, 10, 22, 9, 14, 6, 6, 1, 6, 0, 0, 0, 2, 9, 26, 15, 19, 11, 9, 3, 5, 2]