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.

A326016 Number of knapsack partitions of n such that no addition of one part up to the maximum is knapsack.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 1
16 0
17 0
18 0
19 0
20 0
21 2
22 0
23 0
24 1
25 1
26 0
27 3
28 0
29 0
30 0
31 1
32 0
33 8
34 0
35 8
36 4
37 3
38 0
39 11
40 5
41 3
42 2
43 5
44 0
45 29
46 2
47 9
48 8
49 20
50 2

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 0, 3, 0, 0, 0, 1, 0, 8, 0, 8, 4, 3, 0, 11, 5, 3, 2, 5, 0, 29, 2, 9, 8, 20, 2]