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.

A365921 Triangle read by rows where T(n,k) is the number of integer partitions y of n such that k is the greatest member of {0..n} that is not the sum of any nonempty submultiset of y.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 2, 0, 1, 0, 2, 0, 1, 2, 0, 4, 0, 0, 1, 2, 0, 5, 0, 0, 1, 1, 4, 0, 8, 0, 0, 0, 1, 2, 4, 0, 10, 0, 0, 0, 2, 1, 2, 7, 0, 16, 0, 0, 0, 0, 2, 1, 3, 8, 0, 20, 0, 0, 0, 0, 2, 2, 2, 4, 12, 0, 31, 0, 0, 0, 0, 0, 2, 2, 2, 5, 14, 0]