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.

A326015 Number of strict knapsack partitions of n such that no superset with the same maximum is knapsack.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 1
6 0
7 1
8 1
9 3
10 2
11 4
12 4
13 5
14 3
15 3
16 4
17 6
18 2
19 7
20 6
21 13
22 9
23 19
24 16
25 27
26 21
27 40
28 33
29 47
30 37
31 54
32 48
33 66
34 51
35 65
36 65
37 77
38 64
39 80
40 71
41 96
42 60
43 106
44 95
45 112
46 93
47 152
48 114
49 191
50 131
51 242
52 192
53 303
54 210
55 366
56 300
57 482
58 352
59 581
60 450
61 713
62 539
63 882
64 689
65 995

List of values

[1, 0, 1, 1, 1, 0, 1, 1, 3, 2, 4, 4, 5, 3, 3, 4, 6, 2, 7, 6, 13, 9, 19, 16, 27, 21, 40, 33, 47, 37, 54, 48, 66, 51, 65, 65, 77, 64, 80, 71, 96, 60, 106, 95, 112, 93, 152, 114, 191, 131, 242, 192, 303, 210, 366, 300, 482, 352, 581, 450, 713, 539, 882, 689, 995]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.