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.

A330461 Array read by antidiagonals where A(n,k) is the number of multiset partitions with k levels that are strict at all levels and have total sum n.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 3, 4, 4, 1, 1, 1, 1, 4, 7, 7, 5, 1, 1, 1, 1, 5, 12, 14, 11, 6, 1, 1, 1, 1, 6, 19, 29, 25, 16, 7, 1, 1, 1, 1, 8, 30, 57, 60, 41, 22, 8, 1, 1, 1, 1, 10, 49, 110, 141, 111, 63, 29, 9, 1, 1, 1]