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.

A337584 Triangle read by rows: T(n, k) is the number of integer multisets of size k (partitions of k) that match the multiplicity multiset of some partition of n (n >= 1, 1 <= k <= n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 4, 3, 2, 1, 1, 1, 1, 3, 2, 4, 3, 2, 1, 1, 1, 2, 2, 4, 4, 4, 3, 2, 1, 1, 1, 1, 2, 3, 5, 3, 5, 3, 2, 1, 1, 1, 2, 3, 5, 5, 8, 5, 5, 3, 2, 1, 1, 1, 1, 2, 3, 5, 5, 8, 5, 5, 3, 2, 1, 1, 1, 2, 2, 4, 5, 7, 8, 8, 5, 5, 3]