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.

A369286 Triangle read by rows: T(n,k) is the number of non-isomorphic multiset partitions of weight n with k parts and no constant parts or vertices that appear in only one part, 0 <= k <= floor(n/2).

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 1
9 0
10 0
11 1
12 0
13 0
14 5
15 2
16 0
17 0
18 6
19 3
20 0
21 0
22 16
23 16
24 5
25 0
26 0
27 22
28 44
29 13
30 0
31 0
32 45
33 135
34 82
35 11
36 0
37 0
38 64
39 338
40 301
41 52
42 0
43 0
44 119
45 880
46 1233
47 382
48 34
49 0
50 0
51 171
52 2024
53 4090
54 1936
55 211
56 0
57 0
58 294
59 4674
60 13474
61 9500
62 1843
63 87
64 0
65 0
66 433
67 10191
68 40532
69 40817
70 11778
71 873

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 5, 2, 0, 0, 6, 3, 0, 0, 16, 16, 5, 0, 0, 22, 44, 13, 0, 0, 45, 135, 82, 11, 0, 0, 64, 338, 301, 52, 0, 0, 119, 880, 1233, 382, 34, 0, 0, 171, 2024, 4090, 1936, 211, 0, 0, 294, 4674, 13474, 9500, 1843, 87, 0, 0, 433, 10191, 40532, 40817, 11778, 873]