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.

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

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 0
5 1
6 0
7 2
8 3
9 0
10 2
11 4
12 0
13 4
14 15
15 8
16 0
17 4
18 24
19 19
20 0
21 7
22 60
23 79
24 23
25 0
26 8
27 101
28 213
29 84
30 0
31 12
32 210
33 615
34 424
35 66
36 0
37 14
38 357
39 1523
40 1533
41 363
42 0
43 21
44 679
45 3851
46 5580
47 2217
48 212
49 0
50 24
51 1142
52 8963
53 17836
54 10379
55 1575
56 0
57 34
58 2049
59 20840
60 55730
61 45866
62 11616
63 686

List of values

[1, 0, 0, 1, 0, 1, 0, 2, 3, 0, 2, 4, 0, 4, 15, 8, 0, 4, 24, 19, 0, 7, 60, 79, 23, 0, 8, 101, 213, 84, 0, 12, 210, 615, 424, 66, 0, 14, 357, 1523, 1533, 363, 0, 21, 679, 3851, 5580, 2217, 212, 0, 24, 1142, 8963, 17836, 10379, 1575, 0, 34, 2049, 20840, 55730, 45866, 11616, 686]